Institute for Physics, Humboldt-University of Berlin, Newtonstrasse 15, 12489 Berlin, Germany and Institute of Epidemiology, Friedrich-Loeffler-Institute, Seestrasse 55, 16868 Wusterhausen, Germany.
Institute of Epidemiology, Friedrich-Loeffler-Institute, Seestrasse 55, 16868 Wusterhausen, Germany.
Phys Rev Lett. 2013 Mar 15;110(11):118701. doi: 10.1103/PhysRevLett.110.118701. Epub 2013 Mar 11.
An accessibility graph of a network contains a link wherever there is a path of arbitrary length between two nodes. We generalize the concept of accessibility to temporal networks. Building an accessibility graph by consecutively adding paths of growing length (unfolding), we obtain information about the distribution of shortest path durations and characteristic time scales in temporal networks. Moreover, we define causal fidelity to measure the goodness of their static representation. The practicability of our proposed methods is demonstrated for three examples: networks of social contacts, livestock trade, and sexual contacts.
网络的可达性图包含任意两个节点之间存在路径的链接。我们将可达性的概念推广到时间网络中。通过连续添加长度不断增长的路径（展开）来构建可达性图，我们可以获得有关时间网络中最短路径持续时间和特征时间尺度分布的信息。此外，我们定义因果保真度来衡量其静态表示的好坏。我们提出的方法的实用性在三个示例中得到了证明：社交联系网络、牲畜贸易网络和性接触网络。
