The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Graph Metrics for Temporal Networks
Open accessAbstract
Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs, the concepts of node adjacency and reachability crucially depend on the exact temporal ordering of the links. Consequently, all the concepts and metrics proposed and used for the characterisation of static complex networks have to be redefined or appropriately extended to time-varying graphs, in order to take into account the effects of time ordering on causality. In this chapter we discuss how to represent temporal networks and we review the definitions of walks, paths, connectedness and connected components valid for graphs in which the links fluctuate over time. We then focus on temporal node–node distance, and we discuss how to characterise link persistence and the temporal small-world behaviour in this class of networks. Finally, we discuss the extension of classic centrality measures, including closeness, betweenness and spectral centrality, to the case of time-varying graphs, and we review the work on temporal motifs analysis and the definition of modularity for temporal graphs.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Complex brain networks: graph theoretical analysis of structural and functional systems
Bullmore, E., & Sporns, O. (2009) · Nature Reviews Neuroscience · doi:10.1038/nrn2575 · Cited by 11,820
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 2×
“…of the abundance of specific motifs has helped to explain why biological and technological networks are relatively resilient to failures [25, 24], while the analysis of communities has revealed that there exists a tight relationship between structure of a network and its functioning [10].”
BackgroundMethodComplex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Self-citationNetwork motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368 · cited 2×
“…of the abundance of specific motifs has helped to explain why biological and technological networks are relatively resilient to failures [25, 24], while the analysis of communities has revealed that there exists a tight relationship between structure of a network and its functioning…”
BackgroundNewman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Self-citationDiameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 1×
“…networks, including the graph of the Internet at Autonomous Systems level [46], co-authorship networks [30, 29], the graph of the World Wide Web [2, 6] and functional brain networks [7] have been obtained so far by aggregating all the contacts observed among a certain number of nodes within a…”
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736 · cited 1×
“Recently, Holme and Saram¨aki have published a comprehensive review which presents the available metrics for the characterisation of temporal networks [14].”
Background(2011) · Choice Reviews Online · doi:10.5860/choice.48-3328 · Cited by 2,736
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.056131 · Cited by 2,476
The origin of bursts and heavy tails in human dynamics
Barabási, A.-L. (2005) · Nature · doi:10.1038/nature03459 · Cited by 2,210
Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010) · Science · doi:10.1126/science.1184819 · Cited by 2,123
Scientific collaboration networks. I. Network construction and fundamental results
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016131 · Cited by 2,076
Superfamilies of Evolved and Designed Networks
Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., & Alon, U. (2004) · Science · doi:10.1126/science.1089167 · Cited by 1,412
Community Structure in Directed Networks
Leicht, E. A., & Newman, M. E. J. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.118703 · Cited by 1,116
Collective dynamics of 'small-world' networks
Watts, D. J., & Strogatz, S. H. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.301 · Cited by 988
User interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879
Statistical Mechanics of Complex Networks
(2003) · Lecture Notes in Physics · doi:10.1007/b12331 · Cited by 732
Large-scale topological and dynamical properties of the Internet
Vázquez, A., Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.066130 · Cited by 712 · cited 1×
“After all, most of the classic examples of complex networks, including the graph of the Internet at Autonomous Systems level [46], co-authorship networks [30, 29], the graph of the World Wide Web [2, 6] and functional brain networks [7] have been obtained so far by aggregating all the contacts…”
BackgroundSmall 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
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
Extending the definition of modularity of directed graphs with overlapping communitiesPreprint
Nicosia, V., Mangioni, G., Carchiolo, V., & Malgeri, M. (2009) · Cited by 350
Self-citationExtending the definition of modularity to directed graphs with overlapping communities
Nicosia, V, Mangioni, G., Carchiolo, V, & Malgeri, M. (2009) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2009/03/p03024 · Cited by 346
Self-citationLaplacian Dynamics and Multiscale Modular Structure in Networks
Lambiotte, R., Delvenne, J., & Barahona, M. (2008) · doi:10.48550/arxiv.0812.1770 · Cited by 345
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
Size reduction of complex networks preserving modularity
Arenas, A., Duch, J., Fernández, A., & Gómez, S. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/176 · Cited by 330
Dynamical strength of social ties in information spreading
Miritello, G., Moro, E., & Lara, R. (2011) · Physical Review E · doi:10.1103/physreve.83.045102 · Cited by 306
Small-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
Self-citationTemporal 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
Connectivity and Inference Problems for Temporal Networks
Kempe, D., Kleinberg, J., & Kumar, A. (2002) · Journal of Computer and System Sciences · doi:10.1006/jcss.2002.1829 · Cited by 288
Kostakos, V. (2009) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.11.021 · Cited by 254
Network reachability of real-world contact sequences
Holme, P. (2005) · Physical Review E · doi:10.1103/physreve.71.046119 · Cited by 213
Communicability across evolving networks
Grindrod, P., Parsons, M. C., Higham, D. J., & Estrada, E. (2011) · Physical Review E · doi:10.1103/physreve.83.046120 · Cited by 209
Components in time-varying graphs
Nicosia, V., Tang, J., Musolesi, M., Russo, G., Mascolo, C., & Latora, V. (2012) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3697996 · Cited by 202
Self-citationAnalysing information flows and key mediators through temporal centrality metrics
Tang, J., Musolesi, M., Mascolo, C., Latora, V., & Nicosia, V. (2010) · Proceedings of the 3rd Workshop on Social Network Systems · doi:10.1145/1852658.1852661 · Cited by 194
Self-citationDynamical and bursty interactions in social networks
Stehlé, J., Barrat, A., & Bianconi, G. (2010) · Physical Review E · doi:10.1103/physreve.81.035101 · Cited by 177
Persistence and periodicity in a dynamic proximity networkPreprint
Clauset, A. J., & Eagle, N. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.7343 · Cited by 170
Characterising temporal distance and reachability in mobile and online social networks
Tang, J., Musolesi, M., Mascolo, C., & Latora, V. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1672308.1672329 · Cited by 159
Self-citationComponents in time-varying graphs
Nicosia, V., Tang, J., Musolesi, M., Russo, G., Cecilia Mascolo, C., Latora, V., et al. (2012) · UCL Discovery (University College London) · Cited by 156
Self-citationValencia, M., Martinerie, J. M., Dupont, S., & Chávez, M. (2008) · Physical Review E · doi:10.1103/physreve.77.050905 · Cited by 143
Microdynamics in stationary complex networks
Gautreau, A., Barrat, A., & Barthélemy, M. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0811113106 · Cited by 142
Evaluating Temporal Robustness of Mobile Networks
Scellato, S., Leontiadis, I., Mascolo, C., Basu, P., & Zafer, M. A. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2011.248 · Cited by 72
Self-citationFallani, F. D. V., Latora, V., Astolfi, L., Cincotti, F., Mattia, D., Marciani, M. G., Salinari, S., Colosimo, A., & Babiloni, F. (2008) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/41/22/224014 · Cited by 57
Self-citationApplications of Temporal Graph Metrics to Real-World Networks
Tang, J., Leontiadis, I., Scellato, S., Nicosia, V., Mascolo, C., Musolesi, M., & Latora, V. (2013) · Understanding complex systems · doi:10.1007/978-3-642-36461-7_7 · Cited by 45
Self-citation
Cited by
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
Social network analysis: An overview
Tabassum, S., Pereira, F. S. F., Fernandes, S., & Gama, J. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1256 · Cited by 419
The Why, How, and When of Representations for Complex Systems
Torres, L., Blevins, A. S., Bassett, D., & Eliassi-Rad, T. (2021) · SIAM Review · doi:10.1137/20m1355896 · Cited by 297
Metadata
- Authors
- Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., & Latora, V.
- Venue
- Understanding Complex Systems
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 15-40
- ISSN
- 1860-0832 (ISSN-L)
- 1860-0840
- OpenAlex
- W1874858905
- Cited by
- 269
- References
- 52
- FWCI
- 47.03
- Type
- book chapter
- 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.