Parts | Days | Selection | Search | Updates | Downloads | Help
BP: Fachverband Biologische Physik
BP 23: Networks, From Topology to Dynamics (joint with SOE and DY)
BP 23.2: Talk
Wednesday, March 13, 2013, 16:00–16:15, H37
A macroscopic view on temporal networks — •Hartmut Lentz1,2, Thomas Selhorst1, and Igor M Sokolov2 — 1Friedrich-Loeffler-Institute, Federal Research Institute for Animal Health, 16868 Wusterhausen, Germany — 2Humboldt-University of Berlin, 12489 Berlin, Germany
The concept of accessibility graphs can be extended to temporal networks. An accessibility graph (transitive closure) of a network contains a link, wherever there is a path of arbitrary length between node pairs. Building an accessibility graph by consecutively adding paths of growing length (``unfolding'') yields information about the distribution of shortest path durations and reveals characteristic time-scales in temporal networks. Accessibility contributes a key element for a theoretical framework for the macroscopic analysis of temporal networks, because it maps the whole causal path structure of the system onto a single mathematical object. In addition, we define a causal fidelity, measuring the goodness of the static representation of a temporal network. The methods provided here can be implemented efficiently and their capability is demonstrated in applications, as shown by our discussion of three temporal network data sets, namely social contacts, livestock trade and sexual contacts.
Reference: Unfolding accessibility provides a macroscopic approach to temporal networks, arXiv:1210.2283.