English
Related papers

Related papers: Accelerating Abelian Random Walks with Hyperbolic …

200 papers

In this paper, we investigate random walk based token circulation in dynamic environments subject to failures. We describe hypotheses on the dynamic environment that allow random walks to meet the important property that the token visits…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-09-19 Thibault Bernard , Alain Bui , Devan Sohier

Consider a closed surface $M$ with negative Euler characteristic, and an admissible probability measure on the fundamental group of $M$ with finite first moment. Corresponding to each point in the Teichm\"uller space of $M$, there is an…

Geometric Topology · Mathematics 2024-06-14 Aitor Azemar , Vaibhav Gadre , Sébastien Gouëzel , Thomas Haettel , Pablo Lessa , Caglar Uyanik

We consider random walks in dynamic random environments and propose a criterion which, if satisfied, allows to decompose the random walk trajectory into i.i.d. increments, and ultimately to prove limit theorems. The criterion involves the…

Probability · Mathematics 2024-09-20 Julien Allasia , Rangel Baldasso , Oriane Blondel , Augusto Teixeira

In Diaconis and Saloff-Coste (1996), the authors introduced the simple ``transvection" walk on $\mathrm{GL}_n(\mathbb F_2)$: at each step, choose two distinct rows and add one to the other. In Ben-Hamou (2025), the author recently proved…

Probability · Mathematics 2026-05-27 Natesh Pillai , Aaron Smith

The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…

Dynamical Systems · Mathematics 2014-07-08 Michael Björklund

Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…

Disordered Systems and Neural Networks · Physics 2009-10-28 Tomaso Aste

We study random walks on a $d$-dimensional torus by affine expanding maps whose linear parts commute. Assuming an irrationality condition on their translation parts, we prove that the Haar measure is the unique stationary measure. We deduce…

Dynamical Systems · Mathematics 2022-08-03 Yiftach Dayan , Arijit Ganguly , Barak Weiss

We study the asymptotic behaviour of random walks in i.i.d. random environments on $\Z^d$. The environments need not be elliptic, so some steps may not be available to the random walker. We prove a monotonicity result for the velocity (when…

Probability · Mathematics 2018-11-27 Mark Holmes , Thomas S. Salisbury

In this paper, we study random walks evolving with a directional bias in a two-dimensional random environment with correlations that vanish polynomially. Using renormalization methods first employed for one-dimensional dynamic environments…

Probability · Mathematics 2024-06-14 Julien Allasia

Deterministic walk in an excited random environment is a non-Markov integer-valued process $(X_n)_{n=0}^{\infty}$, whose jump at time $n$ depends on the number of visits to the site $X_n$. The environment can be understood as stacks of…

Probability · Mathematics 2014-10-21 Ivan Matic , David Sivakoff

Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…

Probability · Mathematics 2007-05-23 Jean Mairesse , Frédéric Mathéus

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

Combinatorics · Mathematics 2022-06-14 Stefan Steinerberger , Rekha R. Thomas

We consider a random walk in dimension $d\geq 1$ in a dynamic random environment evolving as an interchange process with rate $\gamma>0$. We only assume that the annealed drift is non-zero. We prove that the empirical velocity of the walker…

Probability · Mathematics 2018-04-18 M. Salvi , F. Simenhaus

In the present paper we find necessary and sufficient conditions for recurrence of random walks on arbitrary subgroups of the group of rational numbers $\mathbb{Q}$.

Probability · Mathematics 2014-11-27 Margaryta Myronyuk

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$; denote it $G_k$. A conjecture of Aldous and Diaconis (1985) asserts, for $k \gg \log |G|$,…

Probability · Mathematics 2025-10-14 Jonathan Hermon , Sam Olesker-Taylor

Motivated by the Asymptotic Equipartition Property and its recently discovered role in the cutoff phenomenon, we initiate the systematic study of varentropy on discrete groups. Our main result is an approximate tensorization inequality…

Probability · Mathematics 2024-09-26 Jonathan Hermon , Xiangying Huang , Francesco Pedrotti , Justin Salez

We introduce a persistent random walk model with finite velocity and self-reinforcing directionality, which explains how exponentially distributed runs self-organize into truncated L\'evy walks observed in active intracellular transport by…

Statistical Mechanics · Physics 2024-02-07 Daniel Han , Marco A. A. da Silva , Nickolay Korabel , Sergei Fedotov

Squaring and adding $\pm 1$ mod p generates a curiously intractable random walk. A similar process over the finite field $\mathbf{F}_q$ (with $q=2^d$) leads to novel connections between elementary Galois theory and probability.

Probability · Mathematics 2021-07-08 Persi Diaconis , Jimmy He , I. Martin Isaacs

The aim of this paper is to represent any continuous local martingale as an almost sure limit of a nested sequence of simple, symmetric random walks, time changed by a discrete quadratic variation process. One basis of this is a similar…

Probability · Mathematics 2010-08-10 Balazs Szekely , Tamas Szabados

We apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving to a uniform random neighbour at each step, a controller is allowed to choose from two independent uniform random neighbours. We prove that this…

Discrete Mathematics · Computer Science 2023-06-22 Agelos Georgakopoulos , John Haslegrave , Thomas Sauerwald , John Sylvester