Related papers: Tightness for Maxima of Generalized Branching Rand…
This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…
We present several refinements on the fluctuations of sequences of random vectors (with values in the Euclidean space $\mathbb{R}^d$) which converge after normalization to a multidimensional Gaussian distribution. More precisely we refine…
We propose a picture of the fluctuations in branching random walks, which leads to predictions for the distribution of a random variable that characterizes the position of the bulk of the particles. We also interpret the $1/\sqrt{t}$…
We study the full distribution $P_M(S)$ of the number of distinct sites $S$ visited by a random walker on a $d$-dimensional lattice after $M$ steps. We focus on the case $d \ge 2$, and we are interested in the long-time limit $M \gg 1$. Our…
We present upper and lower bounds for the tail distribution of the stationary waiting time $D$ in the stable $GI/GI/s$ FCFS queue. These bounds depend on the value of the traffic load $\rho$ which is the ratio of mean service and mean…
We consider a one-dimensional random walk among biased i.i.d. conductances, in the case where the random walk is transient but sub-ballistic: this occurs when the conductances have a heavy-tail at $+\infty$ or at $0$. We prove that the…
In this paper, we rigorously establish the Gumbel-distributed fluctuations of the cover time, normalized by the mean first passage time, for finite-range, symmetric, irreducible random walks on a torus of dimension three or higher. This has…
Coalescing-branching random walks, or {\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a $k$-cobra walk, at each…
In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…
We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…
This paper provides a detailed description for the asymptotics of exponential functionals of random walks with light/heavy tails. We give the convergence rate based on the key observation that the asymptotics depends on the sample paths…
We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…
We investigate the behavior of the length of the longest weakly increasing subsequences (weak LIS) of $n$-step random walks with nonzero integer increments $k = \pm 1, \pm 2, \dots$ given by a zero-mean, symmetric heavy tailed mass…
We study the probability distribution, $P_N(T)$, of the coincidence time $T$, i.e. the total local time of all pairwise coincidences of $N$ independent Brownian walkers. We consider in details two geometries: Brownian motions all starting…
We consider a system of $N$ particles on the real line that evolves through iteration of the following steps: 1) every particle splits into two, 2) each particle jumps according to a prescribed displacement distribution supported on the…
We prove existence of the large deviation principle, with a proper convex rate function, for the distribution of the renormalized distance from the origin of a random walk on a free product of finitely generated groups. As a consequence, we…
We study the asymptotics for the maximum on a random time interval of a random walk with a long-tailed distribution of its increments and negative drift. We extend to a general stopping time a result by Asmussen (1998), simplify its proof,…
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…
We consider the long-time behaviour of a branching random walk in random environment on the lattice $\Z^d$. The migration of particles proceeds according to simple random walk in continuous time, while the medium is given as a random…
Brownian motion is a Gaussian process described by the central limit theorem. However, exponential decays of the positional probability density function $P(X,t)$ of packets of spreading random walkers, were observed in numerous situations…