English
Related papers

Related papers: Random walks on SL_2(C): spectral gap and limit th…

200 papers

We study random walks on the isometry group of a Gromov hyperbolic space or Teichm\"uller space. We prove that the translation lengths of random isometries satisfy a central limit theorem if and only if the random walk has finite second…

Probability · Mathematics 2025-10-21 Inhyeok Choi

We consider an analogue of the Kac random walk on the special orthogonal group $SO(N)$, in which at each step a random rotation is performed in a randomly chosen 2-plane of $\bR^N$. We obtain sharp asymptotics for the rate of convergence in…

Probability · Mathematics 2021-05-25 Bob Hough , Yunjiang Jiang

Consider the space of two dimensional random linear cocycles over a shift in finitely many symbols, with at least one singular and one invertible matrix. We provide an explicit formula for the unique stationary measure associated to such…

Dynamical Systems · Mathematics 2025-10-16 Pedro Duarte , Marcelo Durães , Tomé Graxinha , Silvius Klein

Consider a stationary, weakly dependent sequence of random variables. Given only mild conditions, allowing for polynomial decay of the autocovariance function, we show a Berry-Esseen bound of optimal order $n^{-1/2}$ for studentized…

Probability · Mathematics 2025-04-22 Moritz Jirak

We consider the problem of estimating the slope parameter in functional linear regression, where scalar responses Y1,...,Yn are modeled in dependence of second order stationary random functions X1,...,Xn. An orthogonal series estimator of…

Statistics Theory · Mathematics 2009-01-28 Jan Johannes

We prove a quenched central limit theorem for random walks in i.i.d. weakly elliptic random environments in the ballistic regime. Such theorems have been proved recently by Rassoul-Agha and Sepp\"al\"ainen in [10] and Berger and Zeitouni in…

Probability · Mathematics 2014-09-22 Elodie Bouchet , Christophe Sabot , Renato Soares Dos Santos

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

Probability · Mathematics 2025-09-30 George Andriopoulos

We study stochastic properties of the norm cocycle associated with iid products of positive matrices. We obtain the almost sure invariance principle (ASIP) with rate o(n 1/p) under the optimal condition of a moment or order p > 2 and the…

Probability · Mathematics 2023-01-06 C Cuny , J Dedecker , F Merlevède

In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…

Probability · Mathematics 2010-03-04 C. R. E. Raja , R. Schott

We consider random walks on finitely or countably generated free semigroups, and identify their Poisson boundaries for classes of measures which fail to meet the classical entropy criteria. In particular, we introduce the notion of…

Dynamical Systems · Mathematics 2019-08-13 Behrang Forghani , Giulio Tiozzo

First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…

Probability · Mathematics 2014-05-13 Nuno Luzia

We consider homogeneous open quantum random walks on a lattice with finite dimensional local Hilbert space and we study in particular the position process of the quantum trajectories of the walk. We prove that the properly rescaled position…

Probability · Mathematics 2022-06-08 Raffaella Carbone , Federico Girotti , Anderson Melchor Hernandez

We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments. We show that there are distributions on $[-1,1]$ that cannot be approximated to accuracy $\epsilon$ in…

Data Structures and Algorithms · Computer Science 2023-07-04 Yujia Jin , Christopher Musco , Aaron Sidford , Apoorv Vikram Singh

We obtain explicit Berry-Esseen bounds in the Kolmogorov distance for the normal approximation of non-linear functionals of vectors of independent random variables. Our results are based on the use of Stein's method and of random difference…

Probability · Mathematics 2015-05-19 Raphaël Lachièze-Rey , Giovanni Peccati

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

Probability · Mathematics 2011-10-27 Ron Rosenthal

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Probability · Mathematics 2018-07-19 Roberto I. Oliveira , Yuval Peres

Let $(X, \cal B, \nu)$ be a probability space and let $\Gamma$ be a countable group of $\nu$-preserving invertible maps of $X$ into itself. To a probability measure $\mu$ on $\Gamma$ corresponds a random walk on $X$ with Markov operator $P$…

Dynamical Systems · Mathematics 2011-06-17 Jean-Pierre Conze , Yves Guivarc'h

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…

Dynamical Systems · Mathematics 2023-02-07 Matthieu Dussaule , Marc Peigné , Samuel Tapie

We study the asymptotic behavior of a nonlattice random walk in a general cone of $R^d$ . Following the approach initiated by D. Denisov and V. Wachtel in [8], we use a strong approximation of random walks by the Brownian motion and prove…

Probability · Mathematics 2026-03-30 Thi da Cam Pham , Marc Peigné , Doan Thai Son

We study a family of distributed stochastic optimization algorithms where gradients are sampled by a token traversing a network of agents in random-walk fashion. Typically, these random-walks are chosen to be Markov chains that…

Probability · Mathematics 2024-01-19 Jie Hu , Vishwaraj Doshi , Do Young Eun
‹ Prev 1 3 4 5 6 7 10 Next ›