Reinforced random walks and random distributions
نویسندگان
چکیده
منابع مشابه
Directionally Reinforced Random Walks
This paper introduces and analyzes a class of directionally reinforced random walks The work is motivated by an elementary model for time and space correlations in ocean surface wave elds We develop some basic properties of these walks For instance we investigate recurrence properties and give conditions under which the limiting continuous versions of the walks are Gaussian di usion processes M...
متن کاملReinforced Random Walks and Adic Transformations
To a given finite graph we associate three kinds of adic, or BratteliVershik, systems: stationary, symbol-count, and reinforced. We give conditions for the natural walk measure to be adic-invariant and identify the ergodic adicinvariant measures for some classes of examples. If the walk measure is adicinvariant we relate its ergodic decomposition to the vector of limiting edge traversal frequen...
متن کاملUrn schemes and reinforced random walks
We de ne a reinforced urn process (RUP) to be a reinforced random walk on a state space of urns and we show its partial exchangeability. When it is recurrent, a RUP is a mixture of Markov chains and we characterize its mixing distribution on the space of stochastic matrices. Many Bayesian nonparametric priors, like P olya trees, the beta-Stacy process and, in general, neutral to the right proce...
متن کاملDynamics of Vertex - Reinforced Random Walks Michel
We generalize a result from Volkov (2001,[21]) and prove that, on an arbitrary graph of bounded degree (G, ∼) and for any symmetric reinforcement matrix a = (a i,j) i∼j , the vertex-reinforced random walk (VRRW) eventually localizes with positive probability on subsets which consist of a complete d-partite subgraph plus its outer boundary. We first show that, in general, any stable equilibrium ...
متن کامل3 Stationary Distributions of Random Walks
In today’s lecture, we consider a random walk on an undirected graph. One way to think about a random walk is to imagine somebody walking through a city with no particular goal in mind. At each intersection, he or she chooses a random street to take next. We ask the questions: How long until this person reaches a particular point? How long until he/she has been to every intersection or every st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1990
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1990-1012934-1