English
Related papers

Related papers: Invariance principle for variable speed random wal…

200 papers

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 are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

Probability · Mathematics 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi

In [Aldous,Pitman,1998] a tree-valued Markov chain is derived by pruning off more and more subtrees along the edges of a Galton-Watson tree. More recently, in [Abraham,Delmas,2012], a continuous analogue of the tree-valued pruning dynamics…

Probability · Mathematics 2015-11-26 Wolfgang Löhr , Guillaume Voisin , Anita Winter

In Athreya, L\"ohr, Winter (2016), an invariance principle is stated for a class of strong Markov processes on tree-like metric measure spaces. It is shown that if the underlying spaces converge Gromov vaguely, then the processes converge…

Probability · Mathematics 2016-09-12 Siva Athreya , Wolfgang Löhr , Anita Winter

We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the…

Probability · Mathematics 2024-09-04 Guillaume Conchon--Kerjan , Daniel Kious , Pierre-François Rodriguez

We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that,…

Probability · Mathematics 2015-03-17 Nina Gantert , Sebastian Müller , Serguei Popov , Marina Vachkovskaia

A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the…

Probability · Mathematics 2012-08-17 Peggy Cénac , Brigitte Chauvin , Samuel Herrmann , Pierre Vallois

A Brownian spatial tree is defined to be a pair $(\mathcal{T},\phi)$, where $\mathcal{T}$ is the rooted real tree naturally associated with a Brownian excursion and $\phi$ is a random continuous function from $\mathcal{T}$ into…

Probability · Mathematics 2009-07-27 David A. Croydon

We prove an invariance principle for a general class of continuous time critical branching processes with finite variance (non-local) branching mechanism. We show that the genealogical trees, viewed as random compact metric measure spaces,…

Probability · Mathematics 2026-01-12 Emma Horton , Ellen Powell

Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…

Probability · Mathematics 2007-05-23 Amir Dembo , Peter Morters , Scott Sheffield

Let $\mathbb{T}$ denote a rooted $b$-ary tree and let $\{S_v\}_{v\in \mathbb{T}}$ denote a branching random walk indexed by the vertices of the tree, where the increments are i.i.d. and possess a logarithmic moment generating function…

Probability · Mathematics 2009-12-09 Ming Fang , Ofer Zeitouni

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

Probability · Mathematics 2012-10-24 David Croydon

We consider a transient random walk $(X_n)$ in random environment on a Galton--Watson tree. Under fairly general assumptions, we give a sharp and explicit criterion for the asymptotic speed to be positive. As a consequence, situations with…

Probability · Mathematics 2011-01-11 Elie Aidekon

Let $(M,d,\mu)$ be a uniformly discrete metric measure space satisfying space homogeneous volume doubling condition. We consider discrete time Markov chains on $M$ symmetric with respect to $\mu$ and whose one-step transition density is…

Probability · Mathematics 2015-09-03 Mathav Murugan , Laurent Saloff-Coste

The paper is devoted to the relationship between the continuous Markovian description of Levy flights developed previously and their equivalent representation in terms of discrete steps of a wandering particle, a certain generalization of…

Statistical Mechanics · Physics 2015-06-04 Ihor Lubashevsky

We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…

Statistical Mechanics · Physics 2020-05-13 Francesco Mori , Satya N. Majumdar , Gregory Schehr

The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. We use Dirichlet form methods to construct…

Probability · Mathematics 2011-10-12 Siva Athreya , Michael Eckhoff , Anita Winter

Optimal sample path properties of stochastic processes often involve generalized H\"{o}lder- or variation norms. Following a classical result of Taylor, the exact variation of Brownian motion is measured in terms of $\psi (x) \equiv $…

Probability · Mathematics 2007-11-02 Peter Friz , Harald Oberhauser

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

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

Probability · Mathematics 2021-12-07 Ágnes Backhausz , Charles Bordenave , Balázs Szegedy
‹ Prev 1 2 3 10 Next ›