Steady state and mean recurrence time for random walks on stochastic temporal networks

Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of random walks on temporal networks. Here we theoretically study two types of event-driven random walks on a stochastic temporal network model that produces arbitrary distributions of interevent times. In the so-called active random walk, the interevent time is reinitialized on all links upon each movement of the walker. In the so-called passive random walk, the interevent time is reinitialized only on the link that has been used the last time, and it is a type of correlated random walk. We find that the steady state is always the uniform density for the passive random walk. In contrast, for the active random walk, it increases or decreases with the node's degree depending on the distribution of interevent times. The mean recurrence time of a node is inversely proportional to the degree for both active and passive random walks. Furthermore, the mean recurrence time does or does not depend on the distribution of interevent times for the active and passive random walks, respectively.

[1]  S. Goldstein.  ON DIFFUSION BY DISCONTINUOUS MOVEMENTS, AND ON THE TELEGRAPH EQUATION , 1951 .

[2]  Naoki Masuda,et al.  Random walk centrality for temporal networks , 2014, ArXiv.

[3]  Jean-Pierre Eckmann,et al.  Entropy of dialogues creates coherent structures in e-mail traffic. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Aarnout Brombacher,et al.  Probability... , 2009, Qual. Reliab. Eng. Int..

[5]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Alexandre Arenas,et al.  Optimal network topologies for local search with congestion , 2002, Physical review letters.

[7]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[8]  Peter G. Harrison,et al.  Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems , 2012, ACM SIGMETRICS 2012.

[9]  Erik M. Volz,et al.  Probability based estimation theory for respondent driven sampling , 2008 .

[10]  J. Gillis,et al.  Correlated random walk , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[11]  Albert-László Barabási,et al.  Modeling bursts and heavy tails in human dynamics , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Radu Balescu,et al.  Statistical dynamics: matter out of equilibrium , 1997 .

[13]  Martin Rosvall,et al.  Effect of Memory on the Dynamics of Random Walks on Networks , 2014, J. Complex Networks.

[14]  Alessandro Vespignani,et al.  Random walks and search in time-varying networks. , 2012, Physical review letters.

[15]  Albert-László Barabási,et al.  The origin of bursts and heavy tails in human dynamics , 2005, Nature.

[16]  Jean-Charles Delvenne,et al.  Burstiness and spreading on temporal networks , 2013, ArXiv.

[17]  Martin Rosvall,et al.  Memory in network flows and its effects on spreading dynamics and community detection , 2013, Nature Communications.

[18]  Glynn Winskel,et al.  Proceedings of the 25th International Colloquium on Automata, Languages and Programming , 1998 .

[19]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[20]  Romualdo Pastor-Satorras,et al.  Random walks on temporal networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[22]  Vincent D. Blondel,et al.  Bursts of Vertex Activation and Epidemics in Evolving Networks , 2013, PLoS Comput. Biol..

[23]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[24]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[25]  T. Liggett.  Interacting Particle Systems , 1985 .

[26]  Andrea Baronchelli,et al.  Quantifying the effect of temporal resolution on time-varying networks , 2012, Scientific Reports.

[27]  Arnold O. Allen,et al.  Probability, statistics and queueing theory - with computer science applications (2. ed.) , 1981, Int. CMG Conference.

[28]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[29]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[30]  Kerstin Vogler,et al.  Statistical Dynamics Matter Out Of Equilibrium , 2016 .

[31]  Naoki Masuda,et al.  Temporal networks: slowing down diffusion by long lasting interactions , 2013, Physical review letters.

[32]  Matthew J. Salganik,et al.  5. Sampling and Estimation in Hidden Populations Using Respondent-Driven Sampling , 2004 .

[33]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[34]  Mason A. Porter,et al.  Generalized Master Equations for Non-Poisson Dynamics on Networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[36]  Ingo Scholtes,et al.  Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks , 2013, Nature Communications.

[37]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[38]  R. Durrett.  Lecture notes on particle systems and percolation , 1988 .

[39]  T M Li Ge Te.  Interacting Particle Systems , 2013 .