Let $Γ$ be a countable group acting on a geodesic hyperbolic metric space $X$ and $μ$ a probability measure on $Γ$ which generates a non elementary semi-group. Under the necessary assumption that $μ$ has a finite exponential moment, we establish large deviations results for the distance of a random walk with driving measure $μ$.
We discuss the escape rate of the Brownian motion on a hyperbolic space. We point out that the escape rate is determined by using the Brownian expression of the radial part and a generalized Kolmogorov's test for the one dimensional Brownian motion.
Consider a simple symmetric random walk on the integer lattice $\mathbb{Z}$. Let $E(n)$ denote a favorite edge of the random walk at time $n$. In this paper, we study the escape rate of $E(n)$, and show that almost surely $\liminf_{n\to\infty}\frac{|E(n)|}{\sqrt{n}\cdot(\log n)^{-γ}}$ equals 0 if $γ\le 1$, and is infinity otherwise. We also obtain a law of the iterated logarithm for $E(n)$.
We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the walk on the supercritical tree and observe new trapping phenomena for the walk on the subcritical tree which, in this case, always yield sub-ballisticity. This is contrary to the walk on the supercritical tree which always has some ballistic phase.
We study nearest-neighbors branching random walks started from a point at the interior of a hypercube. We show that the probability that the process escapes the hypercube is monotonically decreasing with respect to the distance of its starting point from the boundary. We derive as a consequence that at all times the number of particles at a site is monotonically decreasing with respect to its distance from the starting point.
We consider the two-dimensional simple random walk conditioned on never hitting the origin, which is,formally speaking, the Doob's $h$-transform of the simple random walk with respect to the potential kernel. We then study the behavior of the future minimum distance of the walk to the origin, and also prove that two independent copies of the conditioned walk, although both transient, will nevertheless meet infinitely many times a.s.
Rotor walk is a deterministic analogue of simple random walk. For any given graph, we construct a rotor configuration for which the escape rate of the corresponding rotor walk is equal to the escape rate of simple random walk, and thus answer a question of Florescu, Ganguly, Levine, and Peres (2014).
On the Escape of a Random Walk From Two Pieces of a Tripartite Set
令$\{A, B, C\}$为样本空间$Ω$的分区。对于从$x \in A$开始的随机游动$S_n = x + \sum_{j=1}^n X_j$,我们发现估计格林函数$G_{A \cup B}(x,y)$和命中时间$E^x(T_C)$为$x, y \in A \cup B$ $x, y \in A \cup B$,其中$C$在某种意义上“分离”$A$和$B$(例如,在命中$C$之前,从$A$跳到$B$,或反之亦然的概率很小)。
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds to a distinct arrangement of transition probabilities, sometimes referred to as the pendulum arrangement. We reduce this problem to a sum over products, combinatorial optimization problem, proving that this unique structure always maximizes the escape time. This general property may influence studies in epidemiology, biology, and computer science to better …
We consider random walks on a non-elementary hyperbolic group endowed with a word distance. To a probability measure on the group are associated two numerical quantities, the rate of escape and the entropy. On the set of admissible probability measures whose support is contained in a given finite set, we show that both quantities depend in an analytic way on the probability measure. Our spectral techniques also give a new proof of the central limit theorem, and imply that the corresponding variance is analytic.
We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to the starting point after n steps scales like $\exp(-cn^{1/3})$.
We consider nonelementary random walks on general hyperbolic spaces. Without any moment condition on the walk, we show that it escapes linearly to infinity, with exponential error bounds. We even get such exponential bounds up to the rate of escape of the walk. Our proof relies on an inductive decomposition of the walk, recording times at which it could go to infinity in several independent directions, and using these times to control further backtracking.
We study random walks on relatively hyperbolic groups whose law is convergent, in the sense that the derivative of its Green function is finite at the spectral radius.When parabolic subgroups are virtually abelian, we prove that for such a random walk satisfies a local limit theorem of the form $p_n(e, e)\sim CR^{-n}n^{-d/2}$, where $p_n(e, e)$ is the probability of returning to the origin at time $n$, $R$ is the inverse of the spectral radius of the random walk and $d$ is the minimal rank of a parabolic subgroup along which the random walk is spectrally degenerate.This concludes the classific…
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where they walk while moving around. In this paper we study one of the simplest conceivable discrete time models of this kind, which works as follows: before every walker step, with probability $p$ a new leaf is added to the vertex currently occupied by the walker. The model grows trees and we call it the Bernoulli Growth Random Walk (BGRW). We show that the BGRW wa…
In this article we consider transient random walks on HNN extensions of finitely generated groups. We prove that the rate of escape w.r.t. some generalised word length exists. Moreover, a central limit theorem with respect to the generalised word length is derived. Finally, we show that the rate of escape, which can be regarded as a function in the finitely many parameters which describe the random walk, behaves as a real-analytic function in terms of probability measures of constant support.
We study random walks on groups with the feature that, roughly speaking, successive positions of the walk tend to be "aligned". We formalize and quantify this property by means of the notion of deviation inequalities. We show that deviation inequalities have several consequences including Central Limit Theorems, the local Lipschitz continuity of the rate of escape and entropy, as well as linear upper and lower bounds on the variance of the distance of the position of the walk from its initial point. In a second part of the paper, we show that the (exponential) deviation inequality holds for me…
We show that the asymptotic entropy of a random walk on a nonelementary hyperbolic group, with symmetric and bounded increments, is differentiable and we identify its derivative as a correlation. We also prove similar results for the rate of escape.
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when the bias converges to its critical value is conjectured to coincide with the weak limit of the uniform SAW. Along the way, we obtain a criterion for the continuity of the escape probability of a biased random walk on a tree as a function of the bias, and show that the collection of escape probability functions for spherically symmetric trees of bounded degree…
We show that the circle packing type of a unimodular random plane triangulation is parabolic if and only if the expected degree of the root is six, if and only if the triangulation is amenable in the sense of Aldous and Lyons. As a part of this, we obtain an alternative proof of the Benjamini-Schramm Recurrence Theorem. Secondly, in the hyperbolic case, we prove that the random walk almost surely converges to a point in the unit circle, that the law of this limiting point has full support and no atoms, and that the unit circle is a realisation of the Poisson boundary. Finally, we show that the…
Let $Γ$ be a countable group acting on a geodesic Gromov-hyperbolic metric space $X$ and $μ$ a probability measure on $Γ$ whose support generates a non-elementary subsemigroup. Under the assumption that $μ$ has a finite exponential moment, we establish large deviations results for the distance and the translation length of a random walk with driving measure $μ$. From our results, we deduce a special case of a conjecture regarding large deviations of spectral radii of random matrix products.
We consider general transformations of random walks on groups determined by Markov stopping times and prove that the asymptotic entropy (resp., rate of escape) of the transformed random walks is equal to the asymptotic entropy (resp., rate of escape) of the original random walk multiplied by the expectation of the corresponding stopping time. This is an analogue of the well-known Abramov's formula from ergodic theory, its particular cases were established earlier by Kaimanovich [1983] and Hartman, Lima, Tamuz [2014].
We show existence of the weak large deviation principle, with a convex rate function, for the renormalized distance from the starting point of irreducible random walks on relatively hyperbolic groups. Under the assumption of finiteness of exponential moments, the full large deviation principle holds, and the rate function governing it can be expressed as the Fenchel-Legendre transform of the limiting logarithmic moment generating function of the sequence of renormalized distances.
Given a probability measure on a finitely generated group, its Martin boundary is a natural way to compactify the group using the Green function of the corresponding random walk. For finitely supported measures in hyperbolic groups, it is known since the work of Ancona and Gou{ë}zel-Lalley that the Martin boundary coincides with the geometric boundary. The goal of this paper is to weaken the finite support assumption. We first show that, in any non-amenable group, there exist probability measures with exponential tails giving rise to pathological Martin boundaries. Then, for probability measur…
We show that the displacement and translation distance of non-elementary random walks on isometry groups of hyperbolic spaces satisfy large deviation principles with the same rate function $I$. Roughly, this means that there exists function $I(t)$ which accurately predicts the exponential decay rate of the probability that the translation distance of a random product of length $n$ is $tn$, and similarly for the displacement. This settles a special case of a conjecture concerning the large deviation principle for the spectral radius of random matrix products. In a second part, we give a charact…
We prove that for the $d$-regular tessellations of the hyperbolic plane by $k$-gons, there are exponentially more self-avoiding walks of length $n$ than there are self-avoiding polygons of length $n$. We then prove that this property implies that the self-avoiding walk is ballistic, even on an arbitrary vertex-transitive graph. Moreover, for every fixed $k$, we show that the connective constant for self-avoiding walks satisfies the asymptotic expansion $d-1-O(1/d)$ as $d\to \infty$; on the other hand, the connective constant for self-avoiding polygons remains bounded. Finally, we show for all …
We study the random planar maps obtained from supercritical Galton--Watson trees by adding the horizontal connections between successive vertices at each level. These are the hyperbolic analog of the maps studied by Curien, Hutchcroft and Nachmias in arXiv:1710.03137, and a natural model of random hyperbolic geometry. We first establish metric hyperbolicity properties of these maps: we show that they admit bi-infinite geodesics and satisfy a weak version of Gromov-hyperbolicity. We also study the simple random walk on these maps: we identify their Poisson boundary and, in the case where the un…
Let $Γ$ be a non-elementary relatively hyperbolic group with a finite generating set. Consider a finitely supported admissible and symmetric probability measure $μ$ on $Γ$ and a probability measure $ν$ on $\mathbb{N}$ with mean $r$. Let $\mathrm{BRW}(Γ,ν,μ)$ be the branching random walk on $Γ$ with offspring distribution $ν$ and base motion given by the random walk with step distribution $μ$. It is known that for $1 < r \leq R$ with $R$ the radius of convergence for the Green function of the random walk, the population of $\mathrm{BRW}(Γ,ν,μ)$ survives forever, but eventually vacates every fin…
In this article we define and study a stochastic process on Galoisian covers of compact manifolds. The successive positions of the process are defined recursively by picking a point uniformly in the Dirichlet domain of the previous one. We prove a theorem à la Kesten for such a process: the escape rate of the random walk is positive if and only if the cover is non amenable. We also investigate more in details the case where the deck group is Gromov hyperbolic, showing the almost sure convergence to the boundary of the trajectory as well as a central limit theorem for the escape rate