Nicosia, Vincenzo;
Tang, John;
Mascolo, Cecilia;
Musolesi, Mirco;
Russo, Giovanni;
Latora, Vito;
(2013)
Graph Metrics for Temporal Networks.
In: Holme, P and Saramäki, J, (eds.)
Temporal Networks.
(pp. 15-40).
Springer Nature: Heidelberg, Germany.
Preview |
Text
1306.0493v1.pdf - Accepted Version Download (476kB) | Preview |
Abstract
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.
| Type: | Book chapter |
|---|---|
| Title: | Graph Metrics for Temporal Networks |
| ISBN-13: | 978-3-642-36460-0 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/978-3-642-36461-7_2 |
| Publisher version: | https://doi.org/10.1007/978-3-642-36461-7_2 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions. |
| Keywords: | Betweenness Centrality, Static Graph, Modularity Function, Closeness Centrality, Temporal Network |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10062937 |
Archive Staff Only
 |
View Item |
