The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Network reachability of real-world contact sequences
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Cited by
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
“community; (b)–(d) comes from e-mail exchange; for details see Holme [91].”
BackgroundMethodInfluentialSelf-citationThe echo chamber effect on social media
Cinelli, M., De Francisci Morales, G., Galeazzi, A., Quattrociocchi, W., & Starnini, M. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2023301118 · Cited by 2,092
“The set of nodes in a recovered state at the end of the dynamics started with user i as a seed of infection, that is, those that become aware of the information initially propagated by user i , form the set of influence of user i , Ii (48).”
BackgroundDynamics of Person-to-Person Interactions from Distributed RFID Sensor Networks
Cattuto, C., Van den Broeck, W., Barrat, A., Colizza, V., Pinton, J.-F., & Vespignani, A. (2010) · PLoS ONE · doi:10.1371/journal.pone.0011596 · Cited by 821
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
Self-citationModeling bursts and heavy tails in human dynamics
Vázquez, A., Oliveira, J. G., Dezsö, Z., Goh, K.-I., Kondor, I., & Barabási, A.-L. (2006) · Physical Review E · doi:10.1103/physreve.73.036127 · Cited by 673
Small but slow world: How network topology and burstiness slow down spreading
Karsai, M., Kivelä, M., Pan, R. K., Kaski, K., Kertész, J., Barabási, A.-L., & Saramäki, J. (2011) · Physical Review E · doi:10.1103/physreve.83.025102 · Cited by 668
Time-varying graphs and dynamic networks
Casteigts, A., Flocchini, P., Quattrociocchi, W., & Santoro, N. (2012) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760.2012.668546 · Cited by 592
Path lengths, correlations, and centrality in temporal networks
Pan, R. K., & Saramäki, J. (2011) · Physical Review E · doi:10.1103/physreve.84.016105 · Cited by 351
The structure of information pathways in a social communication network
Kossinets, G., Kleinberg, J., & Watts, D. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401945 · Cited by 332
Simulated Epidemics in an Empirical Spatiotemporal Network of 50,185 Sexual Contacts
Rocha, L. E. C., Liljeros, F., & Holme, P. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001109 · Cited by 322
Self-citationSmall-world behavior in time-varying graphs
Tang, J., Scellato, S., Musolesi, M., Mascolo, C., & Latora, V. (2010) · Physical Review E · doi:10.1103/physreve.81.055101 · Cited by 301
Temporal motifs in time-dependent networks
Kovanen, L., Karsai, M., Kaski, K., Kertész, J., & Saramäki, J. (2011) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2011/11/p11005 · Cited by 296
Random walks on temporal networks
Starnini, M., Baronchelli, A., Barrat, A., & Pastor-Satorras, R. (2012) · Physical Review E · doi:10.1103/physreve.85.056115 · Cited by 275
Graph Metrics for Temporal Networks
Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., & Latora, V. (2013) · Understanding Complex Systems · doi:10.1007/978-3-642-36461-7_2 · Cited by 269
Temporal dynamics and network analysis
Blonder, B., Wey, T. W., Dornhaus, A., James, R., & Sih, A. (2012) · Methods in Ecology and Evolution · doi:10.1111/j.2041-210x.2012.00236.x · Cited by 254
Kostakos, V. (2009) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.11.021 · Cited by 254
Quantifying echo chamber effects in information spreading over political communication networks
Cota, W., Ferreira, S. C., Pastor-Satorras, R., & Starnini, M. (2019) · EPJ Data Science · doi:10.1140/epjds/s13688-019-0213-9 · Cited by 146
Metadata
- Authors
- Holme, P.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2005-04-15
- Volume
- 71
- Issue
- 4
- Pages
- 046119-046119
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1981599289
- Cited by
- 213
- References
- 1
- FWCI
- 1.80
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.