展开可达性提供了一个宏观的方法来时间网络
Unfolding accessibility provides a macroscopic approach to temporal networks
摘要:
网络的可达性图包含一个链接,只要两个节点之间有一条任意长度的路径。我们将可达性的概念推广到时态网络。通过连续添加增长长度的路径(展开)构建可达性图,我们获得了时间网络中最短路径持续时间和特征时间尺度的分布信息。此外,我们定义因果保真度来衡量其静态表征的好坏。我们提出的方法的实用性证明了三个例子:网络的社会联系,牲畜贸易和性接触。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。