English
Related papers

Related papers: Tracking rates of random walks

200 papers

We show that the probability that a finitely supported random walk on a non-elementary subgroup of the the mapping class group gives a non-pseudo-Anosov element decays exponentially in the length of the random walk. More generally, we show…

Geometric Topology · Mathematics 2016-07-07 Joseph Maher

We consider a recurrent random walk in random environment on a regular tree. Under suitable general assumptions upon the distribution of the environment, we show that the walk exhibits an unusual slow movement: the order of magnitude of the…

Probability · Mathematics 2007-05-23 Yueyun Hu , Zhan Shi

A one-dimensional confined Nonlinear Random Walk is a tuple of $N$ diffeomorphisms of the unit interval driven by a probabilistic Markov chain. For generic such walks, we obtain a geometric characterization of their ergodic stationary…

Dynamical Systems · Mathematics 2016-07-19 Victor Kleptsyn , Denis Volk

Completing a strategy of Gou\"ezel and Lalley, we prove a local limit theorem for the random walk generated by any symmetric finitely supported probability measure on a non-elementary Gromov-hyperbolic group: denoting by $R$ the inverse of…

Dynamical Systems · Mathematics 2012-09-17 Sebastien Gouezel

We study the transience of algebraic varieties in linear groups. In particular, we show that a "non elementary" random walk in SL_2(R) escapes exponentially fast from every proper algebraic subvariety. We also treat the case where the…

Group Theory · Mathematics 2017-05-29 Richard Aoun

Given integers $d \geq 2, n \geq 1$, we consider affine random walks on torii $(\mathbb{Z} / n \mathbb{Z})^{d}$ defined as $X_{t+1} = A X_{t} + B_{t} \mod n$, where $A \in \mathrm{GL}_{d}(\mathbb{Z})$ is an invertible matrix with integer…

Probability · Mathematics 2022-04-04 Bastien Dubail , Laurent Massoulié

We show that a random walk on the mapping class group of an orientable surface of finite type makes linear progress in the relative metric, which is quasi-isometric to the complex of curves.

Geometric Topology · Mathematics 2010-01-24 Joseph Maher

Let $\Gamma$ be a nonelementary hyperbolic group with a word metric $d$ and $\partial\Gamma$ its hyperbolic boundary equipped with a visual metric $d_a$ for some parameter $a>1$. Fix a superexponential symmetric probability $\mu$ on…

Probability · Mathematics 2020-07-28 Vladas Sidoravicius , Longmin Wang , Kainan Xiang

The fundamental inequality of Guivarc'h relates the entropy and the drift of random walks on groups. It is strict if and only if the random walk does not behave like the uniform measure on balls. We prove that, in any nonelementary…

Probability · Mathematics 2015-01-22 Sébastien Gouëzel , Frédéric Mathéus , François Maucourant

We introduce a general class of random walks on the $N$-hypercube, study cut-off for the mixing time, and provide several types of representation for the transition probabilities. We observe that for a sub-class of these processes with long…

Probability · Mathematics 2020-02-24 Andrea Collevecchio , Robert Griffiths

This paper deals with random walks on isometry groups of Gromov hyperbolic spaces, and more precisely with the dimension of the harmonic measure $\nu$ associated with such a random walk. We first establish a link of the form $\dim \nu \leq…

Dynamical Systems · Mathematics 2007-05-23 Vincent Le Prince

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

Probability · Mathematics 2013-07-22 Jean-François Le Gall , Shen Lin

We generalize one part of Thurston's hyperbolic Dehn filling theorem to arbitrary-rank semisimple Lie groups by showing that certain deformations of extended geometrically finite subgroups of a semisimple Lie group are still extended…

Geometric Topology · Mathematics 2025-02-26 Theodore Weisman

We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…

Combinatorics · Mathematics 2011-05-11 Eric Babson , Christopher Hoffman , Matthew Kahle

We consider random walks on the mapping class group whose support generates a non-elementary subgroup and contains a pseudo-Anosov map whose invariant Teichm\"uller geodesic is in the principal stratum. For such random walks, we show that…

Geometric Topology · Mathematics 2016-07-06 Vaibhav Gadre , Joseph Maher

We study simple random walk on the class of random planar maps which can be encoded by a two-dimensional random walk with i.i.d. increments or a two-dimensional Brownian motion via a "mating-of-trees" type bijection. This class includes the…

Probability · Mathematics 2020-08-27 Ewain Gwynne , Jason Miller

We extend results of Y. Benoist and J.-F. Quint concerning random walks on homogeneous spaces of simple Lie groups to the case where the measure defining the random walk generates a semigroup which is not necessarily Zariski dense, but…

Dynamical Systems · Mathematics 2016-11-21 David Simmons , Barak Weiss

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

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

Probability · Mathematics 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi

We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…

Data Structures and Algorithms · Computer Science 2024-06-04 Vedat Levi Alev , Shravas Rao
‹ Prev 1 4 5 6 7 8 10 Next ›