Related papers: Exit time for anchored expansion

We apply the theory of continuous time random walks to study some aspects of the extreme value problem applied to financial time series. We focus our attention on extreme times, specifically the mean exit time and the mean first-passage…

We prove a quenched central limit theorem for balanced random walks in time dependent ergodic random environments which is not necessarily nearest-neigbhor. We assume that the environment satisfies appropriate ergodicity and ellipticity…

A temporal graph is a graph in which the edge set can change from one time step to the next. The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk…

Symmetric heavily tailed random walks on $Z^d, d\geq 1,$ are considered. Under appropriate regularity conditions on the tails of the jump distributions, global (i.e., uniform in $x,t, |x|+t\to\infty,$) asymptotic behavior of the transition…

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…

We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change…

For the one-dimensional telegraph process, we obtain explicit distribution of the occupation time of the positive half-line. The long-term limiting distribution is then derived when the initial location of the process is in the range of…

In this paper we study the mixing time of the simple random walk on the giant component of supercritical $d$-dimensional random geometric graphs generated by the unit intensity Poisson Point Process in a $d$-dimensional cube of volume $n$.…

We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…

We consider a random walk in a random environment (RWRE) on the strip of finite width $\mathbb{Z} \times \{1,2,\ldots,d\}$. We prove both quenched and averaged large deviation principles for the position and the hitting times of the RWRE.…

We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both…

In this paper, we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connecting radius tending to infinity. We obtain that for any infection rate $\lambda >0$, the contact process on…

We investigate excited random walks on $\Z^d, d\ge 1,$ and on planar strips $\Z\times\{0,1,...,L-1\}$ which have a drift in a given direction. The strength of the drift may depend on a random i.i.d. environment and on the local time of the…

A temporal graph $G$ is a sequence $(G_t)_{t \in I}$ of graphs on the same vertex set of size $n$. The \emph{temporal exploration problem} asks for the length of the shortest sequence of vertices that starts at a given vertex, visits every…

We investigate occupation time statistics for random walks on a comb with ramified teeth. This is achieved through the relation between the occupation time and the first passage times. Statistics of occupation times in half space follows…

The usual development of the continuous-time random walk (CTRW) proceeds by assuming that the present is one of the jumping times. Under this restrictive assumption integral equations for the propagator and mean escape times have been…

This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.

We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…

The $\lambda$-biased random walk on a binary tree of depth $n$ is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to…