Related papers: Exit time for anchored expansion

We consider a particle diffusing along the links of a general graph possessing some absorbing vertices. The particle, with a spatially-dependent diffusion constant D(x) is subjected to a drift U(x) that is defined in every point of each…

We investigate the local (or occupation) time of a discrete-time random walk on a generic graph, and present a general method for calculating sample-path averages of local time functionals in terms of the resolvent of the transition matrix.

We consider a continuous time simple random walk on a subset of the square lattice with wired boundary conditions: the walk transitions at unit edge rate on the graph obtained from the lattice closure of the subset by contracting the…

We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

We consider transient random walks on a strip in a random environment. The model was introduced by Bolthausen and Goldsheid [Comm. Math. Phys. 214 (2000) 429--447]. We derive a strong law of large numbers for the random walks in a general…

Given a $M\times M$ Hermitian matrix $\mathcal{H}$ with possibly degenerate eigenvalues $\mathcal{E}_1 < \mathcal{E}_2 < \mathcal{E}_3< \dots$, we provide, in the limit $M\to\infty$, a lower bound for the gap $\mu_2 = \mathcal{E}_2 -…

We derive sub-Gaussian bounds for the annealed transition density of the simple random walk on a high-dimensional loop-erased random walk. The walk dimension that appears in these is the exponent governing the space-time scaling of the…

For a volume preserving map, the exit time, averaged over the incoming set of a region, is given by the ratio of the measure of the accessible subset of the region to that of the incoming set. This result is primarily of interest to show…

Let $\{S_n, n\geq1\}$ be a random walk wih independent and identically distributed increments and let $\{g_n,n\geq1\}$ be a sequence of real numbers. Let $T_g$ denote the first time when $S_n$ leaves $(g_n,\infty)$. Assume that the random…

A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…

Given a simple graph $G$, we consider the node search problem with inert fugitive. We are interested in minimizing the maximum vertex occupation time, i.e. the maximum number of steps in which a vertex is occupied by a searcher during a…

The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

We investigate percolation of the vacant set of random interlacements on $\mathbb{Z}^d$, $d\geq 3$, in the strongly percolative regime. We consider the event that the interlacement set at level $u$ disconnects the discrete blow-up of a…

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

We consider random walks on the line given by a sequence of independent identically distributed jumps belonging to the strict domain of attraction of a stable distribution, and first determine the almost sure exponential divergence rate, as…

We consider a random walk on the support of an ergodic simple point process on R^d, d>1, furnished with independent energy marks. The jump rates of the random walk decay exponentially in the jump length and depend on the energy marks via a…