English
Related papers

Related papers: The speed of random walks on semigroups

200 papers

We prove that there exist infinitely many asymptotics of drift for random walks on finitely generated groups.

Group Theory · Mathematics 2007-05-23 Anna Erschler-Dyubina

We extend some properties of random walks on hyperbolic groups to random walks on convergence groups. In particular we prove that if a convergence group $G$ acts on a compact metrizable space $M$ with the convergence property then we can…

Geometric Topology · Mathematics 2020-06-16 Aitor Azemar

Given a finite-range random walk on a finitely generated free group , what is the asymptotic behaviour, as the number of steps goes to infinity, of the sequence of probabilities that the random walk is at a given element of the group? In…

Probability · Mathematics 2025-07-22 Guillaume Chevalier

Let $G$ be a real Lie group, $\Lambda\leq G$ a lattice, and $\Omega=G/\Lambda$. We study the equidistribution properties of the left random walk on $\Omega$ induced by a probability measure $\mu$ on $G$. It is assumed that $\mu$ has a…

Dynamical Systems · Mathematics 2022-05-26 Timothée Bénard , Nicolas de Saxcé

We use subgroup distortion to determine the rate of escape of a simple random walk on a class of polycyclic groups, and we show that the rate of escape is invariant under changes of generating set for these groups. For metabelian groups, we…

Probability · Mathematics 2011-09-14 Russ Thompson

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

Dynamical Systems · Mathematics 2022-10-18 Timothée Bénard

In this paper we consider finitary symmetric random walks on groups. We construct new possible asymptotics for the drift. We show that the drift can be very close to linear ant yet sublinear. We also give estimates for entropy growth of…

Group Theory · Mathematics 2007-05-23 Anna Erschler-Dyubina

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.

Group Theory · Mathematics 2019-12-19 Richard Aoun

This paper gives conditions for the rightmost particle in the $n$th generation of a multitype branching random walk to have a speed, in the sense that its location divided by n converges to a constant as n goes to infinity. Furthermore, a…

Probability · Mathematics 2012-10-17 J. D. Biggins

We consider several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent $N$ steps. We investigate the speed of the process, and in particular, the limiting speed…

Probability · Mathematics 2019-03-29 Ross G. Pinsky

We study fine structure related to finitely supported random walks on infinite finitely generated discrete groups, largely motivated by dimension group techniques. The unfaithful extreme harmonic functions (defined only on proper space-time…

Functional Analysis · Mathematics 2021-04-01 David Handelman

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…

Probability · Mathematics 2016-09-16 Peter Haissinsky , Pierre Mathieu , Sebastian Mueller

Wildberger gave a method to construct a finite hermitian discrete hypergroup from a random walk on a certain kind of graphs. In this article, we reveal that his method is applicable to a random walk on a certain kind of infinite graphs.…

Probability · Mathematics 2017-06-01 Tomohiro Ikkai , Yusuke Sawada

In this paper, we discuss asymptotic behavior of the capacity of the range of symmetric simple random walks on finitely generated groups. We show the corresponding strong law of large numbers and central limit theorem.

Probability · Mathematics 2021-11-19 Rudi Mrazović , Nikola Sandrić , Stjepan Šebek

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…

Probability · Mathematics 2026-05-19 Boris Bukh , Quentin Dubroff

We consider a random walk in the plane which takes steps uniformly distributed on the unit circle centered around the walker's current position but avoids the convex hull of its past positions. This model has been introduced by Angel,…

Probability · Mathematics 2007-05-23 Martin P. W. Zerner

We study the random walk in random environment on {0,1,2,...}, where the environment is subject to a vanishing (random) perturbation. The two particular cases we consider are: (i) random walk in random environment perturbed from Sinai's…

Probability · Mathematics 2008-05-13 M. V. Menshikov , Andrew R. Wade

We investigate three aspects of weak* convergence of the $n$-step distributions of random walks on finite volume homogeneous spaces $G/\Gamma$ of semisimple real Lie groups. First, we look into the obvious obstruction to the upgrade from…

Dynamical Systems · Mathematics 2024-05-02 Roland Prohaska

We study asymptotic properties of the Green metric associated with transient random walks on countable groups. We prove that the rate of escape of the random walk computed in the Green metric equals its asymptotic entropy. The proof relies…

Probability · Mathematics 2009-09-29 Sébastien Blachère , Peter Haïssinsky , Pierre Mathieu

Let $(Z_n)_{n\in\N}$ be a $d$-dimensional {\it random walk in random scenery}, i.e., $Z_n=\sum_{k=0}^{n-1}Y(S_k)$ with $(S_k)_{k\in\N_0}$ a random walk in $\Z^d$ and $(Y(z))_{z\in\Z^d}$ an i.i.d. scenery, independent of the walk. The…

Probability · Mathematics 2007-05-23 Nina Gantert , Wolfgang König , Zhan Shi