Related papers: Mean first-passage time for maximal-entropy random…
Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each network node.…
In the study of small and large networks it is customary to perform a simple random walk, where the random walker jumps from one node to one of its neighbours with uniform probability. The properties of this random walk are intimately…
The random walk is one of the most basic dynamic properties of complex networks, which has gradually become a research hotspot in recent years due to its many applications in actual networks. An important characteristic of the random walk…
We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any…
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…
Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical…
An efficient and accurate iterative scheme for the computation of the mean first passage times (MFPTs) of ergodic Markov chains has been presented. Firstly, the computation problem of MFPTs is transformed into a set of linear equations. It…
We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some…
In this paper, we consider continuous-time quantum walks (CTQWs) on one-dimension ring lattice of N nodes in which every node is connected to its 2m nearest neighbors (m on either side). In the framework of the Bloch function ansatz, 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…
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 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…
We present a semi-Markov model of random walk on complex networks in discrete and continuous-time scenario. In the general setting of the semi-Markov chains, the duration of stay at given node - the sojourn time - is random, and the…
Recent studies have established a connection between the macroscopic mechanical response of polymeric materials and the statistics of the shortest path (SP) length between distant nodes in the polymer network. Since these statistics can be…
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition…
We study unbiased discrete random walks on the FSFT based on the its self-similar structure and the relations between random walks and electrical networks. First, we provide new methods to derive analytic solutions of the MFPT for any pair…
A new mechanism for efficiently solving the Markov decision processes (MDPs) is proposed in this paper. We introduce the notion of reachability landscape where we use the Mean First Passage Time (MFPT) as a means to characterize the…
Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states, for example those employed in…
An intense research on financial market microstructure is presently in progress. Continuous time random walks (CTRWs) are general models capable to capture the small-scale properties that high frequency data series show. The use of CTRW…
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…