Change search
ReferencesLink to record
Permanent link

Direct link
Network reachability of real-world contact sequences
2005 (English)In: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, ISSN 1063-651X, E-ISSN 1095-3787, Vol. 71, no 4Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2005. Vol. 71, no 4
Keyword [en]
complex networks, graphs
URN: urn:nbn:se:kth:diva-14711DOI: 10.1103/PhysRevE.71.046119ISI: 000228752500027OAI: diva2:332752
QC 20100525Available from: 2010-08-05 Created: 2010-08-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Holme, Petter
In the same journal
Physical Review E. Statistical, Nonlinear, and Soft Matter Physics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 29 hits
ReferencesLink to record
Permanent link

Direct link