相关论文: Vertex-reinforced random walk on arbitrary graphs
We consider a multi-particle generalization of linear edge-reinforced random walk (ERRW). We observe that in absence of exchangeability, new techniques are needed in order to study the multi-particle model. We describe an unusual coupling…
. In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $\mathbb {Z}^d$, $d\geq 1$, we are given a random walk with i.i.d. increments and a random scenery with i.i.d. components. The walk and the…
Let $G$ be a connected graph of uniformly bounded degree. A $k$ non-backtracking random walk ($k$-NBRW) $(X_n)_{n =0}^{\infty}$ on $G$ evolves according to the following rule: Given $ (X_n)_{n =0}^{s}$, at time $s+1$ the walk picks at…
It is a celebrated fact that a simple random walk on an infinite $k$-ary tree for $k \geq 2$ returns to the initial vertex at most finitely many times during infinitely many transitions; it is called transient. This work points out the fact…
We continue the investigation of the localization phenomenon for a Vertex Reinforced Random Walk on the integer lattice. We provide some partial results towards a full characterization of the weights for which localization on 5 sites occurs…
We study the Tree Builder Random Walk: a randomly growing tree, built by a walker as she is walking around the tree. Namely, at each time $n$, she adds a leaf to her current vertex with probability $p_n \asymp n^{-\gamma}$, $\gamma\in…
We prove that the only nearest neighbor jump process with local dependence on the occupation times satisfying the partial exchangeability property is the vertex reinforced jump process, under some technical conditions. This result gives a…
We consider activated random walk (ARW), an interacting particle system and prototypical model of self-organized criticality in a setting which combines mean-field behavior with the geometry of an arbitrary graph, which we call the village…
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…
We consider random walks in random Dirichlet environment (RWDE) which is a special type of random walks in random environment where the exit probabilities at each site are i.i.d. Dirichlet random variables. On $\Z^d$, RWDE are parameterized…
The aim of this paper is to deepen the analysis of the asymptotic behavior of the so-called minimal random walk (MRW) using a new martingale approach. The MRW is a discrete-time random walk with infinite memory that has three regimes…
We introduce a new exponential family of probability distributions, which can be viewed as a multivariate generalization of the Inverse Gaussian distribution. Considered as the potential of a random Schr\"odinger operator, this exponential…
We study once-reinforced random walk (ORRW) on $\mathbb Z$. For this model, we derive limit results on all moments of its range using Tauberian theory.
We study rotor walks on transient graphs with initial rotor configuration sampled from the oriented wired uniform spanning forest (OWUSF) measure. We show that the expected number of visits to any vertex by the rotor walk is at most equal…
Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…
Random walks provide a simple conventional model to describe various transport processes, for example propagation of heat or diffusion of matter through a medium. However, in many practical cases the medium is highly irregular due to…
We introduce a one-dimensional random walk, which at each step performs a reinforced dynamics with probability $\theta$ and with probability $1 - \theta$, the random walk performs a step independent of the past. We analyse its asymptotic…
We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration in the form of…
We review various features of the statistics of random paths on graphs. The relationship between path statistics and Quantum Mechanics (QM) leads to two canonical ways of defining random walk on a graph, which have different statistics and…
We analyze the Brownian Motion limit of a prototypical unit step reinforced random-walk on the half line. A reinforced random walk is one which changes the weight of any edge (or vertex) visited to increase the frequency of return visits.…