Related papers: Record Statistics for Multiple Random Walks

Let $G$ be a finitely generated group equipped with a finite symmetric generating set and the associated word length function $|\cdot |$. We study the behavior of the probability of return for random walks driven by symmetric measures $\mu$…

In this paper, we systematically summarize and enhance the understanding of weak convergence and functional limits of record numbers in discrete-time random walks under Spitzer's condition, and extend these findings to $\sigma$--record…

For the perimeter length $L_n$ and the area $A_n$ of the convex hull of the first $n$ steps of a planar random walk, this thesis study $n \to \infty$ mean and variance asymptotics and establish distributional limits. The results apply to…

For any recurrent random walk (S_n)_{n>0} on R, there are increasing sequences (g_n)_{n>0} converging to infinity for which (g_n S_n)_{n>0} has at least one finite accumulation point. For one class of random walks, we give a criterion on…

Let \begin{equation*} S_{0}=0,\quad S_{n}=X_{1}+...+X_{n},\ n\geq 1, \end{equation*} be a random walk whose increments belong without centering to the domain of attraction of a stable law with scaling constants $a_{n}$, that provide…

While records and order statistics of independent and identically distributed (i.i.d.) random variables X_1, ..., X_N are fully understood, much less is known for strongly correlated random variables, which is often the situation…

We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…

First-passage properties of continuous stochastic processes confined in a 1--dimensional interval are well described. However, for jump processes (discrete random walks), the characterization of the corresponding observables remains…

We investigate the time averaged squared displacement (TASD) of continuous time random walks with respect to the number of steps $N$, which the random walker performed during the data acquisition time $T$. We prove that the TASD, and as…

An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

We study one-dimensional discrete as well as continuous time random walks, either with a fixed number of steps (for discrete time) $n$ or on a fixed time interval $T$ (for continuous time). In both cases, we focus on symmetric probability…

The characterization of record events is considered for a discrete-time random walk model with long-term memory arising from correlations between successive steps. An important feature is that the correlations are strong enough to give rise…

We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…

In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is at variance with respect to the simple symmetric random walk…

We study statistics of records in a sequence of random variables. These identical and independently distributed variables are drawn from the parent distribution rho. The running record equals the maximum of all elements in the sequence up…

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

Given a supercritical branching random walk $\{Z_n\}_{n\geq 0}$ on $\mathbb{R}$, let $Z_n([y,\infty))$ be the number of particles located in $[y,\infty)\subset\mathbb{R}$ at generation $n$. Let $m$ be the mean of the offspring law of…

Record numbers are basic statistics in random walks, whose deviation principles are not very clear so far. In this paper, the asymptotic probabilities of large and moderate deviations for numbers of weak records in right continuous or left…

Given a branching random walk $(Z_n)_{n\geq0}$ on $\mathbb{R}$, let $Z_n(A)$ be the number of particles located in interval $A$ at generation $n$. It is well known (e.g., \cite{biggins}) that under some mild conditions, $Z_n(\sqrt…