Related papers: Non-backtracking random walk
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
We study decentralized learning over networks where data are distributed across nodes without a central coordinator. Random walk learning is a token-based approach in which a single model is propagated across the network and updated at each…
We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…
We consider a two dimensional reflecting random walk on the nonnegative integer quadrant. It is assumed that this reflecting random walk has skip free transitions. We are concerned with its time reversed process assuming that the stationary…
We define two families of Poissonian soups of bidirectional trajectories on $\mathbb{Z}^2$, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus $(\mathbb{Z}/N…
This paper considers the QBD approximation of a special class of two-dimensional reflecting random walks (2D-RRWs). A typical example of the 2D-RRWs is a two-node Jackson network with cooperative servers. The main contribution of this paper…
We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…
We define the model of two-dimensional random interlacements using simple random walk trajectories conditioned on never hitting the origin, and then obtain some properties of this model. Also, for random walk on a large torus conditioned on…
In a recent Letter Ciftci and Cakmak [EPL 87, 60003 (2009)] showed that the two dimensional random walk in a bounded domain, where walkers which cross the boundary return to a base curve near origin with deterministic rules, can produce…
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…
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is a stationary and ergodic process. In general, the stationary…
We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…
We consider a branching system of random walk in random environment (in location) in $\mathbb{N}$. We will give the exact limit value of $\frac{M_{n}}{n}$, where $M_{n}$ denotes the minimal position of branching random walk at time $n$. A…
This paper studies a family of random walks defined on the finite ordinals using their order reversing involutions. Starting at $x \in \{0,1,\ldots,n-1\}$, an element $y \le x$ is chosen according to a prescribed probability distribution,…
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 establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
In this paper we establish a version of the Margulis Roblin equidistribution theorem's for harmonic measures. As a consequence a von Neumann type theorem is obtained for boundary actions and the irreducibility of the associated…