Network reachability of real-world contact sequences

Details Network reachability of real-world contact sequences Network reachability of real-world contact sequences

2004-10-13

arxiv.org/abs/cond-mat/0410313v2

Phys. Rev. E 71, 046119 (2005)

Physics

Condensed Matter

Other Condensed Matter

(v2: fig. 1 fixed)

Scientific paper

10.1103/PhysRevE.71.046119

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 tend to decrease the reachability, and that the order of the contacts really do make sense for dynamical spreading processes.

Affiliated with

Also associated with

No associations

Rating

Network reachability of real-world contact sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Network reachability of real-world contact sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network reachability of real-world contact sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-135955