Related papers: Mean first-passage time for random walks on the T-…
The exact formula for the average hitting time (HT, as an abbreviation) of simple random walks from one vertex to any other vertex on the square $C^2_N$ of an $N$-vertex cycle graph $C_N$ was given by N. Chair [\textit{Journal of…
We consider random walks evolving on two models of connected and undirected graphs and study the exact large deviations of a local dynamical observable. We prove, in the thermodynamic limit, that this observable undergoes a first-order…
Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…
We study the mean first passage time of a one-dimensional active fluctuating membrane that is stochastically returned to the same flat initial condition at a finite rate. We start with a Fokker Planck equation to describe the evolution of…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
This article rigorously analyzes the meeting time between pursuers and evaders performing random walks on digraphs. There exist several bounds on the expected meeting time between random walkers on graphs in the literature, however,…
We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performing independent random walks on a graph. To this end we…
Tracking the movement of tracer particles has long been a strategy for uncovering complex structures. Here, we study discrete-time random walks on finite Cayley trees to infer key parameters such as tree depth and geometric bias toward the…
Refining previous results, we establish a sharp asymptotic estimate on the expected graph distance between the origin and the terminal point of the trace of the first $n$ steps of the walk. A similar conclusion is drawn for the resistance…
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…
Consider a collaborative dynamic of $k$ independent random walks on a finite connected graph $G$. We are interested in the size of the set of vertices visited by at least one walker and study how the number of walkers relates to the…
Consider the time T_oz when the random walk on a weighted graph started at the vertex o first hits the vertex set z. We present lower bounds for T_oz in terms of the volume of z and the graph distance between o and z. The bounds are for…
Based on the mean first passage time (MFPT) theory, we derive the expression of the MFPT in the energy-diffusion controlled regime with a power-law distribution. We discuss the finite barrier effect (i.e. thermal energy is not small with…
We study first-passage statistics for one-dimensional random walks $S_n$ with independent and identically distributed jumps starting from the origin. We focus on the joint distribution of the first-passage time $\tau_b$ and first-passage…
We compute the mean first passage time (MFPT) for a Brownian particle inside a two-dimensional disk with reflective boundaries and a small interior trap that is rotating at a constant angular velocity. The inherent symmetry of the problem…
This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
All real physical processes, including of the first-passage time, occur with a change in entropy. This circumstance is not taken into account when studying the first-passage time, but is illustrated in this article using the example of…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…
In the present paper, we give the exact formula for the average hitting time (HT, as an abbreviation) of random walks from one vertex to any other vertex on the some weighted Cayley graphs.