Related papers: Random walk with priorities in communication-like …
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…
A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…
Random walks have been proven to be useful for constructing various algorithms to gain information on networks. Algorithm node2vec employs biased random walks to realize embeddings of nodes into low-dimensional spaces, which can then be…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
Recently, Watts and Strogatz introduced the so-called small-world networks in order to describe systems which combine simultaneously properties of regular and of random lattices. In this work we study diffusion processes defined on such…
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
This paper investigates the long-time behavior of double branching annihilating random walkers with nearest-neighbor dependent rates. The system consists of even number of particles which can execute nearest-neighbor random walk and they…
Two-dimensional networks of ordered quantum dots beyond the percolation threshold are studied, as typical example of conducting nanostructures with quenched random disorder. Theory predicts anomalous diffusion with stretched-exponential…
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…
Random walk is one of the basic mechanisms found in many network applications. We study the epidemic spreading dynamics driven by biased random walks on complex networks. In our epidemic model, each time infected nodes constantly spread…
We present an individual-based model for two interacting populations diffusing on lattices in which a strong natural selection develops spontaneously. The models combine traditional local predator-prey dynamics with random walks.…
Efficient techniques to navigate networks with local information are fundamental to sample large-scale online social systems and to retrieve resources in peer-to-peer systems. Biased random walks, i.e. walks whose motion is biased on…
The possibility to identify the nature (e.g. random or scale free) of complex networks while performing respective random walks is investigated with respect to autonomous agents based on Bayesian decision theory and humans navigating…
We consider a random walker whose motion is tethered around a focal point. We use two models that exhibit the same spatial dependence in the steady state but widely different dynamics. In one case, the walker is subject to a deterministic…