Related papers: Tracking rates of random walks

We provide a deterministic $\tilde{O}(\log N)$-space algorithm for estimating random walk probabilities on undirected graphs, and more generally Eulerian directed graphs, to within inverse polynomial additive error…

Divergence functions of a metric space estimate the length of a path connecting two points $A$, $B$ at distance $\le n$ avoiding a large enough ball around a third point $C$. We characterize groups with non-linear divergence functions as…

According to a version of Donsker's theorem, geodesic random walks on Riemannian manifolds converge to the respective Brownian motion. From a computational perspective, however, evaluating geodesics can be quite costly. We therefore…

We prove central and local limit theorems for random walks on the Poincar{\'e} hyperbolic space of dimension n {\v e} 2. To this end we use the ball model and describe the walk therein through the M{\"o}bius addition and multiplication.…

We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…

Gromov proposed an averaged version of the Dehn function and claimed that in many cases it should be subasymptotic to the Dehn function. Using results on random walks in nilpotent groups, we confirm this claim for most nilpotent groups. In…

We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup $H$. We further assume…

Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…

This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time $n/2$. Here,…

We prove that in various natural models of a random quotient of a group, depending on a density parameter, for each hyperbolic group there is some critical density under which a random quotient is still hyperbolic with high probability,…

We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and less completely those with five steps. As one of the main results, we obtain a hypergeometric…

We consider continuous-time random walks on a random locally finite subset of $\mathbb{R}^d$ with random symmetric jump probability rates. The jump range can be unbounded. We assume some second--moment conditions and that the above…

We present a careful approximation of the geodesics in trees of hyperbolic or relatively hyperbolic groups. As an application we prove a combination theorem for finite graphs of relatively hyperbolic groups, with both Farb's and Gromov's…

We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

Suppose we are given finitely generated groups $\Gamma_1,...,\Gamma_m$ equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic…

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…

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…

We show that symmetric random walks on non-elementary hyperbolic groups with non-zero homomorphisms into the reals are noise stable at linear scale under finite exponential moment condition.

We characterise hyperbolic groups in terms of quasigeodesics in the Cayley graph forming regular languages. We also obtain a quantitative characterisation of hyperbolicity of geodesic metric spaces by the non-existence of certain local…