English
Related papers

Related papers: Random walks on solvable matrix groups

200 papers

Let $(g_n)_{n\geq 1}$ be a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group $\textup{GL}(V)$, where $V=\mathbb R^d$. Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq…

Probability · Mathematics 2022-09-09 Hui Xiao , Ion Grama , Quansheng Liu

We provide an explicit formula for the global mean first-passage time (GMFPT) for random walks in a general graph with a perfect trap fixed at an arbitrary node, where GMFPT is the average of mean first-passage time to the trap over all…

Statistical Mechanics · Physics 2012-09-28 Yuan Lin , Alafate Julaiti , Zhongzhi Zhang

In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p, and use these results to study the distribution of the rank…

Combinatorics · Mathematics 2020-12-09 Kyle Luh , Sean Meehan , Hoi H. Nguyen

We are interested in the Guivarc'h inequality for admissible random walks on finitely generated relatively hyperbolic groups, endowed with a word metric. We show that for random walks with finite super-exponential moment, if this inequality…

Group Theory · Mathematics 2019-08-06 Matthieu Dussaule , Ilya Gekhtman

As known, the commonly-utilized ways to determine mean first-passage time $\overline{\mathcal{F}}$ for random walk on networks are mainly based on Laplacian spectra. However, methods of this type can become prohibitively complicated and…

Probability · Mathematics 2021-11-18 Fei Ma , Ping Wang

In the present paper, we treat random matrix products on the general linear group $\textrm{GL}(V)$, where $V$ is a vector space defined on any local field, when the top Lyapunov exponent is simple, without irreducibility assumption. In…

Dynamical Systems · Mathematics 2020-06-17 Richard Aoun , Yves Guivarc'h

A variety of behaviors of entropy functions of random walks on finitely generated groups is presented, showing that for any $\frac{1}{2}\leq \alpha\leq\beta\leq1$, there is a group $\Gamma$ with measure $\mu$ equidistributed on a finite…

Group Theory · Mathematics 2013-12-17 Jérémie Brieussel

In this work we propose a novel method to calculate mean first-passage times (MFPTs) for random walks on graphs, based on a dimensionality reduction technique for Markov State Models, known as local-equilibrium (LE). We show that for a…

Statistical Mechanics · Physics 2022-03-09 Yanik-Pascal Förster , Luca Gamberi , Evan Tzanis , Pierpaolo Vivo , Alessia Annibale

We construct, for each real number $0\leq \alpha \leq 1$, a random walk on a finitely generated semigroup whose speed exponent is $\alpha$. We further show that the speed function of a random walk on a finitely generated semigroup can be…

Group Theory · Mathematics 2025-04-15 Guy Blachar , Be'eri Greenfeld

We study random walks on the integers mod $G_n$ that are determined by an integer sequence $\{ G_n \}_{n \geq 1}$ generated by a linear recurrence relation. Fourier analysis provides explicit formulas to compute the eigenvalues of the…

Probability · Mathematics 2017-10-12 Caprice Stanley , Seth Sullivant

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

Probability · Mathematics 2021-02-05 Jonathan Hermon , Sam Olesker-Taylor

For any finitely generated group G, let n ---> \Phi_G(n) be the function that describes the rough asymptotic behavior of the probability of return to the identity element at time 2n of a symmetric simple random walk on G (this is an…

Probability · Mathematics 2013-07-23 Laurent Saloff-Coste , Tianyi Zheng

Let $G$ be a finitely generated group equipped with a finite symmetric generating set and the associated word length function $|\cdot |$. We study the behavior of the probability of return for random walks driven by symmetric measures $\mu$…

Probability · Mathematics 2015-01-26 Laurent Saloff-Coste , Tianyi Zheng

We find uniform lower bounds on the drift for a large family of random walks on graph products, of the form $ \mathbb{P} (|Z_{n}| \leq \kappa n) \leq e ^{-\kappa n} $ for $ \kappa > 0 $. This includes the simple random walk for a…

Probability · Mathematics 2022-04-14 Kunal Chawla

The group of affine transformations with rational coefficients acts naturally on the real line, but also on the $p$-adic fields. The aim of this note is to show that, for random walks whose laws have a finite first moment, all these actions…

Probability · Mathematics 2007-05-23 Sara Brofferio

Given a finitely generated group, the well-known Stability Problem asks whether the non-triviality of the Poisson-Furstenberg boundary (which is equivalent to the existence of non-constant bounded harmonic functions) depends on the choice…

Group Theory · Mathematics 2025-06-12 Anna Erschler , Joshua Frisch

For finitely supported random walks on finitely generated groups $G$ we prove that the identity map on $G$ extends to a continuous equivariant surjection from the Martin boundary to the Floyd boundary, with preimages of conical points being…

Group Theory · Mathematics 2017-12-07 Ilya Gekhtman , Victor Gerasimov , Leonid Potyagailo , Wenyuan Yang

The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…

Probability · Mathematics 2007-05-23 Vadim A. Kaimanovich , Yuri Kifer , Ben-Zion Rubshtein

We investigate the translation lengths of group elements that arise in random walks on the isometry groups of Gromov hyperbolic spaces. In particular, without any moment condition, we prove that non-elementary random walks exhibit at least…

Geometric Topology · Mathematics 2023-10-10 Hyungryul Baik , Inhyeok Choi , Dongryul M. Kim

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