Related papers: First-passage times for random walks with non-iden…

We write $R_n$ for the minimal position attained after time $n$ by a branching random walk in the boundary case. In this article, we prove that $R_n - \frac{1}{2} \log n$ converges in law toward a shifted Gumbel distribution.

Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the…

We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time $n$. Assuming that the moment of order $2+\delta$ is…

We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and…

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

We show that all the time-dependent statistical properties of the rightmost points of a branching Brownian motion can be extracted from the traveling wave solutions of the Fisher-KPP equation. We show that the distribution of all the…

A collection of identical and independent rare event first passage times is considered. The problem of finding the fastest out of $N$ such events to occur is called an extreme first passage time. The rare event times are singular and limit…

Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

We develop techniques to obtain rigorous bounds on the behaviour of random walks on combs. Using these bounds we calculate exactly the spectral dimension of random combs with infinite teeth at random positions or teeth with random but…

It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…

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…

Consider the invariance principle for a random walk with random environment (denoted by $\mu$) in time on $\bfR$ in a weak quenched sense. We show that a sequence of the random probability measures on $\bfR$ generated by a bounded Lipschitz…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

The random walk process in a nonhomogeneous medium, characterised by a L\'evy stable distribution of jump length, is discussed. The width depends on a position: either before the jump or after that. In the latter case, the density slope is…

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

This paper explores the joint behaviour of the summands of a random walk when their mean value goes to infinity as its length increases. It is proved that all the summands must share the same value, which extends previous results in the…

In this paper, we consider a random walk and a random color scenery on Z. The increments of the walk and the colors of the scenery are assumed to be i.i.d. and to be independent of each other. We are interested in the random process of…

In this paper, we reveal the branching structure for a non-homogeneous random walk with bounded jumps. The ladder time $T_1,$ the first hitting time of $[1,\infty)$ by the walk starting from $0,$ could be expressed in terms of a…