Related papers: Invariance principle for variable speed random wal…
We consider the Markov random flight $\bold X(t), \; t>0,$ in the three-dimensional Euclidean space $\Bbb R^3$ with constant finite speed $c>0$ and the uniform choice of the initial and each new direction at random time instants that form a…
A class of Gaussian processes generalizing the usual fractional Brownian motion for Hurst indices in (1/2,1) and multifractal Brownian motion introduced in Ralchenko and Shevchenko (Theory Probab Math Stat 80, 2010) and Boufoussi et al.…
We study a system of simple random walks on $\mathcal{T}_{d,n} = \mathcal{V}_{d,n}, \mathcal{E}_{d,n})$, the $d$-ary tree of depth $n$, known as the frog model. Initially there are Pois($\lambda$) particles at each site, independently, with…
In this paper, we study the random walk on a supercritical branching process with an uncountable and unbounded set of types supported on the $d$-regular tree $\mathbb{T}_d$ ($d\geq 3$), namely the cluster $\mathcal{C}_\circ^h$ of the root…
A step reinforced random walk is a discrete time process with memory such that at each time step, with fixed probability $p \in (0,1)$, it repeats a previously performed step chosen uniformly at random while with complementary probability…
This study in centered on models accounting for stochastic deformations of sample paths of random walks, embedded either in $\mathbb{Z}^2$ or in $\mathbb{Z}^3$. These models are immersed in multi-type particle systems with exclusion.…
We consider additive functionals of stationary Markov processes and show that under Kipnis-Varadhan type conditions they converge in rough path topology to a Stratonovich Brownian motion, with a correction to the Levy area that can be…
Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph…
In a random complete and separable metric space that we call the lookdown space, we encode the genealogical distances between all individuals ever alive in a lookdown model with simultaneous multiple reproduction events. We construct…
In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of…
Imagine you walk in a plane. You move by making a step of a certain length per time interval in a chosen direction. Repeating this process by randomly sampling step length and turning angle defines a two-dimensional random walk in what we…
We introduce a variational theory for processes adapted to the multi-dimensional Brownian motion filtration. The theory provides a differential structure which describes the infinitesimal evolution of Wiener functionals at very small…
We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…
We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine…
Billera-Holmes-Vogtmann (BHV) tree space is a geodesic metric space of edge-weighted phylogenetic trees with a fixed leaf set. Constructing parametric distributions on this space is challenging due to its non-Euclidean geometry and the…
There are many classical random walk in random environment results that apply to ergodic random planar environments. We extend some of these results to random environments in which the length scale varies from place to place, so that the…
Consider a random walk on a tree $G=(V,E)$. For $v,w \in V$, let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at $v$ to reach $w$, and let $\pi_v = \mathrm{deg}(v)/2|E|$ denote the…
We statistically analyze empirical plug-in estimators for unbalanced optimal transport (UOT) formalisms, focusing on the Kantorovich-Rubinstein distance, between general intensity measures based on observations from spatio-temporal point…
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…