相关论文: Analytical results for the distribution of first r…
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 random walks (RWs) on random regular graphs (RRGs) of degree $c \ge 3$ and a finite size $N$. Starting from a random initial node at time $t=1$, at each time step…
We present analytical results for the distribution of first return (FR) times of non-backtracking random walks (NBWs) on undirected configuration model networks consisting of $N$ nodes with degree distribution $P(k)$. We focus on the case…
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…
We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…
We present analytical results for the joint probability distribution $P(T_{FR}=t,S=s)$ of first return (FR) times t and of the number of distinct sites s visited by a random walk (RW) on a one dimensional lattice before returning to 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 present analytical results for the distribution of first hitting times of random walkers (RWs) on directed Erd\H{o}s-R\'enyi (ER) networks. Starting from a random initial node, a random walker hops randomly along directed edges between…
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…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
We derive a general formula for computing the expected first return time of a random walk on a finite graph. Using this framework, we calculate the expected first return time in various settings over bounded rectangular grids with different…
Random walks have wide application in real lives, ranging from target search, reaction kinetics, polymer chains, to the forecast of the arrive time of extreme events, diseases or opinions. In this paper, we consider discrete random walks on…
The first return time (FRT) is the time it takes a random walker to first return to its original site, and the global first passage time (GFPT) is the first passage time for a random walker to move from a randomly selected site to a given…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
We investigate the first passage statistics of active continuous time random walks with Poissonian waiting time distribution on a one dimensional infinite lattice and a two dimensional infinite square lattice. We study the small and large…
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…
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…
Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple…
Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…