English
Related papers

Related papers: Random walks on solvable matrix groups

200 papers

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

Probability · Mathematics 2021-02-15 Jimmy He

We show under weak hypotheses that $\partial X$, the Roller boundary of a finite dimensional CAT(0) cube complex $X$ is the Furstenberg-Poisson boundary of a sufficiently nice random walk on an acting group $\Gamma$. In particular, we show…

Group Theory · Mathematics 2015-07-21 Talia Fernós

We study high moments of truncated Wigner nxn random matrices by using their representation as the sums over the set W of weighted even closed walks. We construct the subset W' of W such that the corresponding sum diverges in the limit of…

Probability · Mathematics 2010-05-20 O. Khorunzhiy

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

Group Theory · Mathematics 2022-07-13 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

Random walks have wide application in real lives, ranging from target search, reaction kinetics, polymer chains, to the forecast of the arrive time of extreme events, diseases or opinions. In this paper, we consider discrete random walks on…

Probability · Mathematics 2020-01-22 Junhao Peng , Renxiang Shao , Huoyun Wang

We study the isoperimetric profiles of certain families of finitely generated groups defined via marked Schreier graphs and permutation wreath products. The groups we study are among the "simplest" examples within a much larger class of…

Probability · Mathematics 2015-10-30 Laurent Saloff-Coste , Tianyi Zheng

We study first passage percolation (FPP) on a Gromov-hyperbolic group $G$ with boundary $\partial G$ equipped with the Patterson-Sullivan measure $\nu$. We associate an i.i.d.\ collection of random passage times to each edge of a Cayley…

Probability · Mathematics 2024-12-24 Riddhipratim Basu , Mahan Mj

Let $G$ be a countable group and $\mu$ a probability measure on $G$. We build a new framework to compute asymptotic quantities associated with the $\mu$-random walk on $G$, using methods from harmonic analysis on groups and Banach space…

Dynamical Systems · Mathematics 2026-03-24 Benjamin Anderson-Sackaney , Tim de Laat , Ebrahim Samei , Matthew Wiersma

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 investigate the large deviation probabilities of first passage times (FPT) of discrete-time supercritical non-lattice branching random walks (BRWs) in $\mathbb{R}^d$ where $d\geq 1$. The FPT refers to the first time the BRW enters a ball…

Probability · Mathematics 2025-08-21 Jose Blanchet , Wei Cai , Shaswat Mohanty , Zhenyuan Zhang

For every $3/4\le \delta, \beta< 1$ satisfying $\delta\leq \beta < \frac{1+\delta}{2}$ we construct a finitely generated group $\Gamma$ and a (symmetric, finitely supported) random walk $X_n$ on $\Gamma$ so that its expected distance from…

Group Theory · Mathematics 2015-09-02 Gideon Amir

In a recent paper of Eichelsbacher and Koenig (2008) the model of ordered random walks has been considered. There it has been shown that, under certain moment conditions, one can construct a k-dimensional random walk conditioned to stay in…

Probability · Mathematics 2009-07-17 D. Denisov , V. Wachtel

Let G be a vertex transitive graph. A study of the range of simple random walk on G and of its bridge is proposed. While it is expected that on a graph of polynomial growth the sizes of the range of the unrestricted random walk and of its…

Probability · Mathematics 2007-05-23 Itai Benjamini , Roey Izkovsky , Harry Kesten

The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics community. In this paper, according to the known connections…

Statistical Mechanics · Physics 2010-01-30 Zhongzhi Zhang , Yi Qi , Shuigeng Zhou , Shuyang Gao , Jihong Guan

Let $A_n= \varepsilon_n \cdots \varepsilon_1$, where $(\varepsilon_n)_{n \geq 1}$ is a sequence of independent random matrices taking values in $ GL_d(\mathbb R)$, $d \geq 2$, with common distribution $\mu$. In this paper, under standard…

Probability · Mathematics 2022-11-03 C Cuny , J Dedecker , F Merlevède , M Peligrad

Given a sequence of lattice approximations $D_N\subset\mathbb Z^2$ of a bounded continuum domain $D\subset\mathbb R^2$ with the vertices outside $D_N$ fused together into one boundary vertex $\varrho$, we consider discrete-time simple…

Probability · Mathematics 2024-03-05 Yoshihiro Abe , Marek Biskup , Sangchul Lee

For a zero-delayed random walk on the real line, let $\tau(x)$, $N(x)$ and $\rho(x)$ denote the first passage time into the interval $(x,\infty)$, the number of visits to the interval $(-\infty,x]$ and the last exit time from $(-\infty,x]$,…

Probability · Mathematics 2011-12-12 Alexander Iksanov , Matthias Meiners

We study a random walk on the Lie algebra $\mathfrak{sl}_2(\mathbf{F}_p)$ where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we…

Rings and Algebras · Mathematics 2025-12-12 Urban Jezernik , Matevž Miščič

A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…

Classical Analysis and ODEs · Mathematics 2007-05-23 J. B. Sanders , N. M. Temme

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