The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Temporal graphs
Open accessAbstract
We introduce the idea of temporal graphs, a representation that encodes temporal data into graphs while fully retaining the temporal information of the original data. This representation lets us explore the dynamic temporal properties of data by using existing graph algorithms (such as shortest-path), with no need for data-driven simulations. We also present a number of metrics that can be used to study and explore temporal graphs. Finally, we use temporal graphs to analyse real-world data and present the results of our analysis.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Threshold models of collective behavior
Granovetter, M. (1978) · American Journal of Sociology · doi:10.1086/226707 · Cited by 6,072
Understanding individual human mobility patterns
González, M. C., Hidalgo, C. A., & Barabási, A.-L. (2008) · Nature · doi:10.1038/nature06958 · Cited by 6,059
Micromotives and Macrobehavior
Eaton, B. C., & Schelling, T. C. (1981) · The Canadian Journal of Economics · doi:10.2307/134812 · Cited by 3,758
Reality mining: sensing complex social systems
Eagle, N., & (Sandy) Pentland, A. (2006) · Personal and Ubiquitous Computing · doi:10.1007/s00779-005-0046-3 · Cited by 2,772
A simple model of global cascades on random networks
Watts, D. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.082090499 · Cited by 2,673
Micromotives and Macrobehavior.
Connolly, T., & Schelling, T. C. (1979) · Administrative Science Quarterly · doi:10.2307/2989930 · Cited by 2,009
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
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
Cited by
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
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
GeniePath: Graph Neural Networks with Adaptive Receptive Paths
Liu, Z., Chen, C., Li, L., Zhou, J., Li, X., Song, L., & Qi, Y. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33014424 · Cited by 350
Temporal node centrality in complex networks
Kim, H., & Anderson, R. (2012) · Physical Review E · doi:10.1103/physreve.85.026107 · Cited by 314
Metadata
- Authors
- Kostakos, V.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2009-03
- Volume
- 388
- Issue
- 6
- Pages
- 1007-1023
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W3037066368
- Cited by
- 254
- References
- 32
- FWCI
- 9.55
- 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: Temporal graphs. https://app.cochat.ai/papers/10.1016/j.physa.2008.11.021
- The paper
- Kostakos, V. (2009). Temporal graphs. Physica A: Statistical Mechanics and its Applications. https://doi.org/10.1016/j.physa.2008.11.021
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.