Random walks and search in time-varying networks.

  title={Random walks and search in time-varying networks.},
  author={Nicola Perra and Andrea Baronchelli and Delia Mocanu and Bruno Gonçalves and Romualdo Pastor-Satorras and Alessandro Vespignani},
  journal={Physical review letters},
  volume={109 23},
The random walk process underlies the description of a large number of real-world phenomena. Here we provide the study of random walk processes in time-varying networks in the regime of time-scale mixing, i.e., when the network connectivity pattern and the random walk process dynamics are unfolding on the same time scale. We consider a model for time-varying networks created from the activity potential of the nodes and derive solutions of the asymptotic behavior of random walks and the mean… 

Figures from this paper

Random walks in time-varying networks with memory.
This work analyzes how an individual's memory affects random-walk process unfolding on the network when the timescales of the processes of the random walk and the network evolution are comparable and finds that anindividual's memory enhances the activity fluctuation and leads to the formation of small clusters of mutual contacts with high activity nodes.
Classes of random walks on temporal networks with competing timescales
This work introduces random walks on general stochastic temporal networks allowing for lasting interactions, with up to three competing timescales, and compares the mean resting time and stationary state of different models.
Random walk on temporal networks with lasting edges
This work proposes a comprehensive analytical and numerical treatment on directed acyclic graphs of random walks on dynamical networks where edges appear and disappear during finite time intervals and introduces a general analytical framework to characterize such non-Markovian walks.
Random walks in non-Poissoinan activity driven temporal networks
This work derives analytic expressions for the steady state occupation probability and first passage time distribution in the infinite network size and strong aging limits, showing that the random walk dynamics on non-Markovian networks are fundamentally different from what is observed in Markovian Networks.
Steady state and mean recurrence time for random walks on stochastic temporal networks
This work theoretically study two types of event-driven random walks on a stochastic temporal network model that produces arbitrary distributions of interevent times and finds that the steady state is always the uniform density for the passive random walk.
Slow relaxation dynamics and aging in random walks on activity driven temporal networks
We investigate the dynamic relaxation of random walks on temporal networks by focusing in the recently proposed activity driven model [N. Perra, B. Gonçalves, R. Pastor-Satorras, A. Vespignani, Sci.
Edge-attractor random walks on dynamic networks
The edge-attractor RW model is introduced in which the network dynamics is biased towards graph configurations displaying higher degree for the vertex currently occupied by the walker, and the joint process describing the edgeattractorRW on a time-reversible dynamic network is time reversible.
Random walks on activity-driven networks with attractiveness.
This work presents a time-varying network model where each node and the dynamical formation of ties are characterized by these two features, and shows that previously disregarded properties of real social systems, such as heterogeneous distributions of activity and attractiveness as well as the correlations between them, substantially affect the Dynamical process unfolding on the network.
Excitations Transfer and Random Walks on Dynamic Contacts Networks
Diffusion and spreading processes are strongly influenced by the topology of the substrate. An interesting example is provided by exchange reactions in the diffusion-limited regime, that model the


Random walk and trapping processes on scale-free networks.
  • L. Gallos
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
The dynamics of random walk processes on scale-free networks in a short to moderate time scale are investigated and it is shown that the random walkers remain close to their origin, but cover a large part of the network at the same time.
Random walks on temporal networks.
It is shown that the random walk exploration is slower on temporal networks than it is on the aggregate projected network, even when the time is properly rescaled, and a fundamental role is played by the temporal correlations between consecutive contacts present in the data.
Random walks on complex networks.
The random walk centrality C is introduced, which is the ratio between its coordination number and a characteristic relaxation time, and it is shown that it determines essentially the mean first-passage time (MFPT) between two nodes.
Random walks on complex trees.
It is observed that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts, and the mean first passage time (MFPT) displays a logarithmic degree dependence, in contrast to the inverse degree shape exhibited in looped networks.
Mean-field diffusive dynamics on weighted networks.
A general formalism that allows to easily write down mean-field equations for any diffusive dynamics on weighted networks is introduced, and the concept of annealed weighted networks, in which such equations become exact is proposed.
Diffusion processes on power-law small-world networks.
In one dimension, a rich phase diagram is found, with different transient and recurrent phases, including a critical line with continuously varying exponents, which provides a general framework for understanding processes on small-world networks with different distributions of long-range links.
Temporal Networks
Complex Networks: Structure, Robustness and Function
This chapter discusses random network models, which are based on the Erdos-Renyi models, and their application in the context of complex networks, where distances in scale-free networks are small and distances in complex networks are large.
Statistical mechanics of complex networks
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.