Related papers: Nonfixation for Activated Random Walks

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

We consider a recurrent random walk (RW) in random environment (RE) on a strip. We prove that if the RE is i. i. d. and its distribution is not supported by an algebraic subsurface in the space of parameters defining the RE then the RW…

We derive the first two moments of generic positive stochastic functionals in terms of the one- and two-time probability density functions of the underlying random walk, and we prove ergodicity of observables in stationary random walks.…

We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree. The term \textit{multiplexed} means that the model can be viewed as a nearest…

We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…

In this article, we present new random walk methods to solve flow and transport problems in unsaturated/saturated porous media, including coupled flow and transport processes in soils, heterogeneous systems modeled through random hydraulic…

We consider excited random walk (ERW) on $\mathbb{Z}$ in environments with identical stacks of infinitely many cookies at each site, subject to the constraint that the total drift per site $\delta = \sum (2p_j - 1)$ is finite. Building on…

We consider a discrete random walk (RW) in n dimensions . The RW is adapted with a geometric absorption process: at any discrete time there is a constant probability that absorption occurs in the current state. To model the RW with…

Network embedding, which maps graphs to distributed representations, is a unified framework for various graph inference tasks. According to the topology properties (e.g., structural roles and community memberships of nodes) to be preserved,…

In this article, we study linearly edge-reinforced random walk on general multi-level ladders for large initial edge weights. For infinite ladders, we show that the process can be represented as a random walk in a random environment, given…

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…

Let $\{\mm_n, n=0,1,...\}$ be the supercritical branching random walk starting with one initial ancestor located at the origin of the real line. For $n=0,1,...$ let $W_n$ be the moment generating function of $\mm_n$ normalized by its mean.…

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…

A $\delta$ once-reinforced random walk ($\delta$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges…

We study Vertex-Reinforced-Random-Walk on the complete graph with weights of the form $w(n)=n^\alpha$, with $\alpha>1$. Unlike for the Edge-Reinforced-Random-Walk, which in this case localizes a.s. on 2 sites, here we observe various phase…

Some stochastic systems are particularly interesting as they exhibit critical behavior without fine-tuning of a parameter, a phenomenon called self-organized criticality. In the context of driven-dissipative steady states, one of the main…

We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph…

We analyze a two-offspring Branching Annihilating Random Walk ($n=2$ BAW) model, with finite annihilation rate. The finite annihilation rate allows for a dynamical phase transition between a vacuum, absorbing state and a non-empty, active…

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

Flow and multicomponent reactive transport in saturated/unsaturated porous media are modeled by ensembles of computational particles moving on regular lattices according to specific random walk rules. The occupation number of the lattice…