Network reachability of real-world contact sequences Export

@article{holme:reachability, abstract = {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.}, author = {Holme, Petter}, citeulike-article-id = {5390802}, citeulike-linkout-0 = {http://dx.doi.org/10.1103/PhysRevE.71.046119}, citeulike-linkout-1 = {http://link.aps.org/abstract/PRE/v71/i4/e046119}, citeulike-linkout-2 = {http://link.aps.org/pdf/PRE/v71/i4/e046119}, doi = {10.1103/PhysRevE.71.046119}, journal = {Physical Review E}, keywords = {dtn, encounters, epidemic, routing}, month = {Apr}, number = {4}, pages = {046119+}, posted-at = {2009-08-07 07:51:30}, priority = {2}, publisher = {American Physical Society}, title = {Network reachability of real-world contact sequences}, url = {http://dx.doi.org/10.1103/PhysRevE.71.046119}, volume = {71}, year = {2005} }

TY - JOUR ID - holme:reachability L3 - citeulike-article-id:5390802 N2 - 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. IS - 4 JF - Physical Review E TI - Network reachability of real-world contact sequences PB - American Physical Society VL - 71 SP - 046119 KW - dtn KW - encounters KW - epidemic KW - routing AU - Holme, Petter PY - 2005/Apr// UR - http://dx.doi.org/10.1103/PhysRevE.71.046119 ER -