Related papers: First encounters on Bethe Lattices and Cayley Tree…
Extensive empirical investigation has shown that a plethora of real networks synchronously exhibit scale-free and modular structure, and it is thus of great importance to uncover the effects of these two striking properties on various…
We provide exact results for the mean and variance of first-passage times (FPTs) of making a directed revolution in the presence of a bias in heterogeneous quenched environments where the disorder is expressed by random traps on a ring with…
The L\'evy walk process for the lower interval of the time of flight distribution ($\alpha<1$) and with finite resting time between consecutive flights is discussed. The motion is restricted to a region bounded by two absorbing barriers and…
Many scientific questions can be framed as asking for a first passage time (FPT), which generically describes the time it takes a random "searcher" to find a "target." The important timescale in a variety of biophysical systems is the time…
First passage times (FPTs) are often used to study timescales in physical, chemical, and biological processes. FPTs generically describe the time it takes a random "searcher" to find a "target." In many systems, the important timescale is…
We prove CLTs for biased randomly trapped random walks in one dimension. In particular, we will establish an annealed invariance principal by considering a sequence of regeneration times under the assumption that the trapping times have…
For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this paper, we study the MFPT of random walks in the famous…
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike networked models. Here, our goal is to analytically determine the…
Analytical results for the distribution of first hitting times of random walks on Erd\H{o}s-R\'enyi networks are presented. Starting from a random initial node, a random walker hops between adjacent nodes until it hits a node which it has…
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…
Consider the model where particles are initially distributed on $\mathbb{Z}^d, \, d\geq 2$, according to a Poisson point process of intensity $\lambda>0$, and are moving in continuous time as independent simple symmetric random walks. We…
A merge tree is a fundamental topological structure used to capture the sub-level set (and similarly, super-level set) topology in scalar data analysis. The interleaving distance is a theoretically sound, stable metric for comparing merge…
We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…
We present analytical results for the distribution of first hitting times of non-backtracking random walks on finite Erd\H{o}s-R\'enyi networks of $N$ nodes. The walkers hop randomly between adjacent nodes on the network, without stepping…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…
In this work we consider a simple random walk embedded in a generic branched structure and we find a close-form formula to calculate the hitting time $H\left(i,f\right)$ between two arbitrary nodes $i$ and $j$. We then use this formula to…
We study map lattices coupled by collision and show how perturbations of transfer operators associated with the spatially periodic approximation of the model can be used to extract information about collisions per lattice unit. More…
Narrow escape and narrow capture problems which describe the average times required to stop the motion of a randomly travelling particle within a domain have applications in various areas of science. While for general domains, it is known…
We show that residence time measure can be used to identify the geometrical and transmission properties of a defect along a path. The model we study is based on a one--dimensional simple random walk. The sites of the lattice are regular,…