Related papers: Mean cover time of one-dimensional persistent rand…
The territory explored by a random walk is a key property that may be quantified by the number of distinct sites that the random walk visits up to a given time. The extent of this spatial exploration characterizes many important physical,…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…
We present analytical results for the distribution of cover times of random walks (RWs) on random regular graphs consisting of $N$ nodes of degree $c$ ($c \ge 3$). Starting from a random initial node at time $t=1$, at each time step $t \ge…
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…
We study the search kinetics of an immobile target by a concentration of randomly moving searchers. The object of the study is to optimize the probability of detection within the constraints of our model. The target is hidden on a…
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
How long does it take a random walker to reach a given target point? This quantity, known as a first passage time (FPT), has led to a growing number of theoretical investigations over the last decade1. The importance of FPTs originates from…
We derive a scaling limit in law for the cover time of a simple random walk on a lattice version of a scaled-up planar domain with wired boundary conditions. The limiting distribution is that of a Gumbel Random Variable shifted randomly by…
We consider the simple random walk conditioned to stay forever in a finite domain $D_N \subset \mathbb{Z}^d, d \geq 3$ of typical size $N$. This confined walk is a random walk on the conductances given by the first eigenvector of the…
We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for…
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 study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
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…
Cover times quantify the speed of exhaustive search. In this work, we compute exactly the mean cover time associated with a one-dimensional Brownian search under exponentially distributed resetting. We also approximate the moments of cover…