Related papers: Random walks in small-world exponential treelike n…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…
Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes sampling, etc.…
For a random walk on a network, the mean first-passage time from a node $i$ to another node $j$ chosen stochastically according to the equilibrium distribution of Markov chain representing the random walk is called Kemeny constant, which is…
We considered diffusion-driven processes on small-world networks with distance-dependent random links. The study of diffusion on such networks is motivated by transport on randomly folded polymer chains, synchronization problems in…
We propose the Temporal Walk Centrality, which quantifies the importance of a node by measuring its ability to obtain and distribute information in a temporal network. In contrast to the widely-used betweenness centrality, we assume that…
We consider a continuous-time branching random walk on $\mathbb{Z}$ in a random non homogeneous environment. Particles can walk on the lattice points or disappear with random intensities. The process starts with one particle at initial time…
We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition…
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…
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…
In this paper, we consider discrete time random walks on the pseudofractal scale-free web (PSFW) and we study analytically the related first passage properties. First, we classify the nodes of the PSFW into different levels and propose a…
We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [Tadi\'c, Physica A {\bf 293},…
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 investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
Random walks, and in particular, their first passage times, are ubiquitous in nature. Using direct enumeration of paths, we find the first return time distribution of a 1D random walker, which is a heavy-tailed distribution with infinite…
We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain a random walk sample. We first present a fast sublinear…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
As a basic dynamic feature on complex networks, the property of random walk has received a lot of attention in recent years. In this paper, we first studied the analytical expression of the mean global first passage time (MGFPT) on the…