Network reachability of real-world contact sequences
Network reachability of real-world contact sequences
复制标题
DOI：
10.1103/physreve.71.046119
复制
发表时间：
2005-04-01
影响因子：
2.4
通讯作者：
Holme, P
中科院分区：
文献类型：
--
作者：
Holme, P
我们使用现实世界的接触序列，从一个人到另一个人的按时间顺序排列的接触列表，来研究信息或疾病在接触网络中传播的速度。具体地说，我们测量了可达性时间——一系列接触在可达的一对顶点之间传播信息的平均最短时间（从一个人到另一个人的接触链存在的一对顶点）——以及可达性比率——可达顶点对的分数。利用条件一致图检验对这些测度进行了研究。我们得出结论，除其他外，网络的可达性在很大程度上取决于路径长度短且通信频繁的核心，边缘的接触点在时间上的聚类倾向于降低可达性，并且接触点的顺序确实对动态传播过程有意义。
We use real-world contact sequences, time-ordered lists of contacts from one person to another, to study how fast information or disease can spread across network of contacts. Specifically we measure the reachability time-the average shortest time for a series of contacts to spread information between a reachable pair of vertices (a pair where a chain of contacts exists leading from one person to the other)-and the reachability ratio-the fraction of reachable vertex pairs. These measures are studied using conditional uniform graph tests. We conclude, among other things, that the network reachability depends much on a core where the path lengths are short and communication frequent, that clustering of the contacts of an edge in time tends to decrease the reachability, and that the order of the contacts really does make sense for dynamical spreading processes.