English
Related papers

Related papers: Random walks on Bratteli diagrams

200 papers

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

Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…

Probability · Mathematics 2007-05-23 Jean Mairesse , Frédéric Mathéus

Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…

Machine Learning · Statistics 2021-07-22 Dominik Kloepfer , Angelica I. Aviles-Rivero , Daniel Heydecker

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Probability · Mathematics 2018-10-09 Ruojun Huang

This paper investigates the Einstein relation; the connection between the volume growth, the resistance growth and the expected time a random walk needs to leave a ball on a weighted graph. The Einstein relation is proved under different…

Probability · Mathematics 2008-01-16 Andras Telcs

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…

Probability · Mathematics 2016-10-21 Nathanael Berestycki , Eyal Lubetzky , Yuval Peres , Allan Sly

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

Probability · Mathematics 2020-01-06 Marek Biskup , Pierre-François Rodriguez

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

Wildberger's construction enables us to obtain a hypergroup from a special graph via random walks. We will give a probability theoretic interpretation to products on the hypergroup. The hypergroup can be identified with a commutative…

Probability · Mathematics 2020-01-23 Kenta Endo , Ippei Mimura , Yusuke Sawada

In this paper, we study random walks $g_n=f_{n-1}\cdots f_0$ on the group $\mathrm{Homeo}(S^1)$ of the homeomorphisms of the circle, where the homeomorphisms $f_k$ are chosen randomly, independently, with respect to a same probability…

Dynamical Systems · Mathematics 2017-05-09 Dominique Malicet

The paper deals with a new class of random walks strictly connected with the Pareto distribution. We consider stochastic processes in the sense of generalized convolution or weak generalized convolution following the idea given in [1]. The…

Probability · Mathematics 2014-12-02 Barbara H. Jasiulis-Gołdyn

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

Probability · Mathematics 2015-08-18 Andrea Collevecchio , Kais Hamza , Meng Shi

We consider a transitive action of a finitely generated group $G$ and the Schreier graph $\Gamma$ defined by this action for some fixed generating set. For a probability measure $\mu$ on $G$ with a finite first moment we show that if the…

Group Theory · Mathematics 2021-05-18 Bogdan Stankov

A random walk on a $N$-dimensional hypercube is a discrete time stochastic process whose state space is the set $\{-1,+1\}^{N}$, which has uniform probability of reaching any neighbour state, and probability zero of reaching a non-neighbour…

Probability · Mathematics 2019-10-22 Cláudia Peixoto , Diego Marcondes

Random walk models, such as the trap model, continuous time random walks, and comb models exhibit weak ergodicity breaking, when the average waiting time is infinite. The open question is: what statistical mechanical theory replaces the…

Statistical Mechanics · Physics 2007-05-23 Golan Bel , Eli Barkai

It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity with n. The spectral measure for random graphs G(n, c/n)…

Combinatorics · Mathematics 2024-05-15 Eva-Maria Hainzl , Élie de Panafieu

We introduce a method for studying monotonicity of the speed of excited random walks in high dimensions, based on a formula for the speed obtained via cut-times and Girsanov's transform. While the method gives rise to similar results as…

Probability · Mathematics 2015-09-01 Cong-Dan Pham

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

In this paper, we provide an application to the random distance-$t$ walk in finite planes and derive asymptotic formulas (as $q \to \infty$) for the probability of return to start point after $\ell$ steps based on the "vertical"…

Combinatorics · Mathematics 2024-01-15 Charles Brittenham , Jonathan Pakianathan