首页 | 本学科首页   官方微博 | 高级检索  
     


Reinforced Random Walks and Adic Transformations
Authors:Sarah Bailey Frick  Karl Petersen
Affiliation:(1) Movement Science Group, School of Life Sciences, Oxford Brookes University, Gipsy Lane, Headington, Oxford, OX3 0BP, UK;(2) Department of Neurology and Section of Neuroradiology, Medical University Graz, Graz, Austria;(3) Department of Clinical Neurology, University of Oxford, Oxford, UK;(4) School of Life Sciences, Oxford Brookes University, Oxford, UK;(5) Oxford Centre for Enablement, Oxford, UK;(6) Department of Mathematical Sciences, School of Technology, Oxford Brookes University, Oxford, UK;(7) FMRIB, University of Oxford, Oxford, UK;(8) GlaxoSmithKline, Imperial College London, London, UK
Abstract:To a given finite graph we associate three kinds of adic, or Bratteli–Vershik, systems: stationary, symbol-count, and reinforced. We give conditions for the natural walk measure to be adic-invariant and identify the ergodic adic-invariant measures for some classes of examples. If the walk measure is adic-invariant, we relate its ergodic decomposition to the vector of limiting edge traversal frequencies. For some particular nonsimple reinforcement schemes, we calculate the density function of the edge traversal frequencies explicitly.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号