Related papers: Maximal Entropy Random Walks in Z: Random and non-…

$M$-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on $\mathbb{Z}$. For $M \in \N$, an \emph{$M$-Lipschitz mapping} of a connected rooted graph $G = (V,E)$ is a mapping…

We study loop erased random walk (LERW) on the percolation cluster, with occupation probability $p\geq p_c$, in two and three dimensions. We find that the fractal dimensions of LERW$_p$ is close to normal LERW in Euclidean lattice, for all…

This work extends Roberts et al. (1997) by considering limits of Random Walk Metropolis (RWM) applied to block IID target distributions, with corresponding block-independent proposals. The extension verifies the robustness of the optimal…

Following the recent work of Sznitman (arXiv:0805.4516), we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form G_N x Z, where G_N is a large finite connected weighted graph, and relate it to…

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

We generalize a result from Volkov [Ann. Probab. 29 (2001) 66--91] and prove that, on a large class of locally finite connected graphs of bounded degree $(G,\sim)$ and symmetric reinforcement matrices $a=(a_{i,j})_{i,j\in G}$, the…

We study the enhanced diffusivity in the so called elephant random walk model with stops (ERWS) by including symmetric random walk steps at small probability $\epsilon$. At any $\epsilon > 0$, the large time behavior transitions from…

We study a random walk in a random environment (RWRE) on $\Z^d$, $1 \leq d < +\infty$. The main assumptions are that conditionned on the environment the random walk is reversible. Moreover we construct our environment in such a way that 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 in a finite Abelian group $G$ are studied. They use Markov chains with doubly stochastic transition matrices, in a Birkhoff subpolytope ${\cal B}(G)$ associated with the group $G$. It is shown that all future probability…

A Random walk labeling of a graph $G$ is any labeling of $G$ that could have been obtained by performing a random walk on $G$. Continuing two recent works, we calculate the number of random walk labelings of perfect trees, combs, and double…

We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…

We study Random Walks in an i.i.d. Random Environment (RWRE) defined on $b$-regular trees. We prove a functional central limit theorem (FCLT) for transient processes, under a moment condition on the environment. We emphasize that we make no…

We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…

Random walk is an explainable approach for modeling natural processes at the molecular level. The Random Permutation Set Theory (RPST) serves as a framework for uncertainty reasoning, extending the applicability of Dempster-Shafer Theory.…

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.…

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…

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…

Let G be a quasirandom graph on n vertices, and let W be a random walk on G of length alpha n^2. Must the set of edges traversed by W form a quasirandom graph? This question was asked by B\"ottcher, Hladk\'y, Piguet and Taraz. Our aim in…

We prove a scaling limit result for random walk on certain random planar maps with its natural time parametrization. In particular, we show that for $\gamma \in (0,2)$, the random walk on the mated-CRT map with parameter $\gamma$ converges…