相关论文: Vertex-reinforced random walk on arbitrary graphs
We introduce a class of multifractal processes, referred to as Multifractal Random Walks (MRWs). To our knowledge, it is the first multifractal processes with continuous dilation invariance properties and stationary increments. MRWs are…
In the present paper, we introduce and analyze elephant random walks (ERWs) on bipartite periodic lattices arising as coverings of dipole graphs. We focus on lattices whose admissible step directions in the two parts of the bipartition are…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
We investigate the non-reversible generalization of the Vertex-Reinforced Jump Process (VRJP), called the *-Vertex-Reinforced Jump Process (*-VRJP) and introduced by Bacallado, Sabot and Tarr\`es (2020). It can be seen as the…
Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
We consider a class of strongly edge-reinforced random walks, where the corresponding reinforcement weight function is nondecreasing. It is known, from Limic and Tarr\`{e}s [Ann. Probab. (2007), to appear], that the attracting edge emerges…
In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence $w$ satisfying $w(k) = o(k^{\alpha})$ for some $\alpha < 1/2$ is recurrent. This improves on previous results of Volkov (2006)…
We prove polynomial decay of the mixing field of the Vertex Reinforced Jump Process (VRJP) on $\Bbb{Z}^2$ with bounded conductances. Using [17] we deduce that the VRJP on $\Bbb{Z}^2$ with any constant conductances is almost surely…
It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.
A random walk with echoed steps (RWES) is a process $\{\tilde{S}_n\}_{n\geq1}=\{\tilde{X}_1+\cdots+\tilde{X}_n\}_{n\geq1}$ that inserts memory and echo into an ordinary random walk (ORW) with i.i.d. steps, $X_1+\cdots+X_n$. The RWES is…
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a…
We consider a non-linear vertex-reinforced jump process (VRJP($w$)) on $\mathbb{Z}$ with an increasing measurable weight function $w:[1,\infty)\to [1,\infty)$ and initial weights equal to one. Our main goal is to study the asymptotic…
A continuous time random walk (CTRW) is a random walk in which both spatial changes represented by jumps and waiting times between the jumps are random. The CTRW is coupled if a jump and its preceding or following waiting time are dependent…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
We consider a Random Walk in Random Environment (RWRE) moving in an i.i.d.\ random field of obstacles. When the particle hits an obstacle, it disappears with a positive probability. We obtain quenched and annealed bounds on the tails of the…
A simple strategy to explore a network is to use a random-walk where the walker jumps from one node to an adjacent node at random. It is known that biasing the random jump, the walker can explore every walk of the same length with equal…