Related papers: Passage time of the frog model has a sublinear var…
For first passage percolation (FPP) on Euclidean lattices $\mathbb{Z}^d$ with $d\ge 2$, it is expected that the variance of the first passage time between two points grows sublinearly in the distance with a universal exponent strictly…
We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…
We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times \{1, \cdots, k\},$ namely the slab $\mathbb{S}_k$ of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $p_c(\mathbb{S}_k)$)…
We prove central limit theorem under diffusive scaling for the displacement of a random walk on ${\mathbb Z}^d$ in stationary divergence-free random drift field, under the ${\mathcal H}_{-1}$-condition imposed on the drift field. The…
Consider a stochastic growth model on $\mathbb{Z} ^d$. Start with some active particle at the origin and sleeping particles elsewhere. The initial number of particles at $x \in \mathbb{Z} ^d$ is $\eta(x)$, where $\eta (x)$ are independent…
We consider the standard first passage percolation model on $\mathbb Z^d$ with bounded and bounded away from zero weights. We show that the rescaled passage time $\widetilde{\mathbf T}_{n,X}$ restricted to a compact set $X$ satisfies a…
We study the equilibrium fluctuations of a tagged particle in finite-range simple exclusion processes on Z^d with biased single particle jump rates. It is known the variance of the tagged particle at time t is diffusive, that is on order…
Intuition suggests that passage times across a region increases with the number of barriers along the path. Can this fail depending on the nature of the barrier? To probe this fundamental question, we exactly solve for the first passage…
We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
We study first-passage percolation in two dimensions, using measures mu on passage times with b:=inf supp(mu) >0 and mu({b})=p \geq p_c, the threshold for oriented percolation. We first show that for each such mu, the boundary of the limit…
We investigate the escape behavior of systems governed by the one-dimensional nonlinear diffusion equation $\partial_t \rho = \partial_x[\partial_x U\rho] + D\partial^2_x \rho^\nu$, where the potential of the drift, $U(x)$, presents a…
We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. Each active particle performs a simple random walk with…
We prove a central limit theorem under diffusive scaling for the displacement of a random walk on ${\mathbb Z}^d$ in stationary and ergodic doubly stochastic random environment, under the $\mathcal{H}_{-1}$-condition imposed on the drift…
We study the so-called elephant random walk (ERW) which is a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory which exhibits a phase transition from diffusive to superdiffusive behaviour. We prove a law of large…
We introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…
This article extends the results of Fang & Zeitouni (2012a) on branching random walks (BRWs) with Gaussian increments in time inhomogeneous environments. We treat the case where the variance of the increments changes a finite number of…
The one-dimensional elephant random walk is a typical model of discrete-time random walk with step-reinforcement, and is introduced by Sch\"{u}tz and Trimper (2004). It has a parameter $\alpha \in (-1,1)$: The case $\alpha=0$ corresponds to…
We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…
Piecewise Diffusion Markov Processes (PDifMPs) are valuable for modelling systems where continuous dynamics are interrupted by sudden shifts and/or changes in drift and diffusion. The first-passage time (FPT) in such models plays a central…