The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Path lengths, correlations, and centrality in temporal networks
Open accessAbstract
In temporal networks, where nodes interact via sequences of temporary events, information or resources can only flow through paths that follow the time ordering of events. Such temporal paths play a crucial role in dynamic processes. However, since networks have so far been usually considered static or quasistatic, the properties of temporal paths are not yet well understood. Building on a definition and algorithmic implementation of the average temporal distance between nodes, we study temporal paths in empirical networks of human communication and air transport. Although temporal distances correlate with static graph distances, there is a large spread, and nodes that appear close from the static network view may be connected via slow paths or not at all. Differences between static and temporal properties are further highlighted in studies of the temporal closeness centrality. In addition, correlations and heterogeneities in the underlying event sequences affect temporal path lengths, increasing temporal distances in communication networks and decreasing them in the air transport network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Identification of influential spreaders in complex networks
Kitsak, M., Gallos, L. K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H. E., & Makse, H. A. (2010) · Nature Physics · doi:10.1038/nphys1746 · Cited by 3,212
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3328 · Cited by 2,736
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 1×
“Often, networks represent the complex lattices on which some dynamical processes unfold [4], from information flow to epidemic spreading.”
BackgroundThe Structure and Dynamics of Networks
Newman, M., Barabási, A.-L., & Watts, D. J. (2011) · Princeton University Press eBooks · doi:10.1515/9781400841356 · Cited by 2,268
Structure and tie strengths in mobile communication networks
Onnela, J.-P., Saramäki, J., Hyvönen, J., Szabó, G., Lazer, D., Kaski, K., Kertész, J., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610245104 · Cited by 1,926
Self-citationDorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Research works printed but not linked: 5
- D. Kempe, 2000, STOC ’00: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing
- J. Tang, 2010, Proceedings of the 3rd Workshop on Social Network Systems, SNS ’10
- F. Mattern, 1988, Proceedings of the International Workshop on Parallel and Distributed Algorithms
- G. Kossinets, 2008, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’08
- A.-L. Barabási, 2010, Bursts: The Hidden Pattern Behind Everything We Do
Cited by
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
“Furthermore, there are correlationswhere interaction events trigger further events, such as reception of an e-mail triggering a forwarding event, or incoming calls causing outgoing calls in mobile call networks [18,19,26,27].”
BackgroundInfluentialSelf-citationModern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
Boldi, P., & Vigna, S. (2014) · Internet Mathematics · doi:10.1080/15427951.2013.865686 · Cited by 419
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
Self-citationRandom 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
Metadata
- Authors
- Pan, R. K., & Saramäki, J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2011-07-18
- Volume
- 84
- Issue
- 1
- Pages
- 016105-016105
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1985718595
- Cited by
- 351
- References
- 28
- FWCI
- 17.67
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Path lengths, correlations, and centrality in temporal networks. https://app.cochat.ai/papers/10.1103/physreve.84.016105
- The paper
- Pan, R. K., & Saramäki, J. (2011). Path lengths, correlations, and centrality in temporal networks. Physical Review E. https://doi.org/10.1103/physreve.84.016105
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.