Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 351

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 access
Pan, Raj Kumar, Saramäki, Jari·2011·Physical Review E

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreve.84.016105

Cites

28 of 28 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 28 references

Research works printed but not linked: 5

  1. D. Kempe, 2000, STOC ’00: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing
  2. J. Tang, 2010, Proceedings of the 3rd Workshop on Social Network Systems, SNS ’10
  3. F. Mattern, 1988, Proceedings of the International Workshop on Parallel and Distributed Algorithms
  4. G. Kossinets, 2008, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’08
  5. A.-L. Barabási, 2010, Bursts: The Hidden Pattern Behind Everything We Do

Cited by

See all 351

Metadata

Authors
Pan, R. K., & Saramäki, J.
Venue
Physical Review E
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.