Random Walks on Stochastic Temporal Networks

In the study of dynamical processes on networks, there has been intense focus on network structure -- i.e., the arrangement of edges and their associated weights -- but the effects of the temporal patterns of edges remains poorly understood. In this chapter, we develop a mathematical framework for random walks on temporal networks using an approach that provides a compromise between abstract but unrealistic models and data-driven but non-mathematical approaches. To do this, we introduce a stochastic model for temporal networks in which we summarize the temporal and structural organization of a system using a matrix of waiting-time distributions. We show that random walks on stochastic temporal networks can be described exactly by an integro-differential master equation and derive an analytical expression for its asymptotic steady state. We also discuss how our work might be useful to help build centrality measures for temporal networks.Comment: Chapter in Temporal Networks (Petter Holme and Jari Saramaki editors). Springer. Berlin, Heidelberg 2013. The book chapter contains minor corrections and modifications. This chapter is based on arXiv:1112.3324, which contains additional calculations and numerical simulation

Timing interactions in social simulations: The voter model

The recent availability of huge high resolution datasets on human activities has revealed the heavy-tailed nature of the interevent time distributions. In social simulations of interacting agents the standard approach has been to use Poisson processes to update the state of the agents, which gives rise to very homogeneous activity patterns with a well defined characteristic interevent time. As a paradigmatic opinion model we investigate the voter model and review the standard update rules and propose two new update rules which are able to account for heterogeneous activity patterns. For the new update rules each node gets updated with a probability that depends on the time since the last event of the node, where an event can be an update attempt (exogenous update) or a change of state (endogenous update). We find that both update rules can give rise to power law interevent time distributions, although the endogenous one more robustly. Apart from that for the exogenous update rule and the standard update rules the voter model does not reach consensus in the infinite size limit, while for the endogenous update there exist a coarsening process that drives the system toward consensus configurations.Comment: Book Chapter, 23 pages, 9 figures, 5 table