Higher-Order Aggregate Networks in the Analysis of Temporal Networks: Path structures and centralities
arXiv:1508.06467 · doi:10.1140/epjb/e2016-60663-0
Abstract
Recent research on temporal networks has highlighted the limitations of a static network perspective for our understanding of complex systems with dynamic topologies. In particular, recent works have shown that i) the specific order in which links occur in real-world temporal networks affects causality structures and thus the evolution of dynamical processes, and ii) higher-order aggregate representations of temporal networks can be used to analytically study the effect of these order correlations on dynamical processes. In this article we analyze the effect of order correlations on path-based centrality measures in real-world temporal networks. Analyzing temporal equivalents of betweenness, closeness and reach centrality in six empirical temporal networks, we first show that an analysis of the commonly used static, time-aggregated representation can give misleading results about the actual importance of nodes. We further study higher-order time-aggregated networks, a recently proposed generalization of the commonly applied static, time-aggregated representation of temporal networks. Here, we particularly define path-based centrality measures based on second-order aggregate networks, empirically validating that node centralities calculated in this way better capture the true temporal centralities of nodes than node centralities calculated based on the commonly used static (first-order) representation. Apart from providing a simple and practical method for the approximation of path-based centralities in temporal networks, our results highlight interesting perspectives for the use of higher-order aggregate networks in the analysis of time-stamped network data.
arXiv comment27 pages, 13 figures, 3 tables
References in corpus (15)
- Temporal Networks
- Activity driven modeling of time varying networks
- Small But Slow World: How Network Topology and Burstiness Slow Down Spreading
- Modern temporal network theory: A colloquium
- Estimating Potential Infection Transmission Routes in Hospital Wards Using Wearable Proximity Sensors
- Information diffusion epidemics in social networks
- Memory in network flows and its effects on spreading dynamics and community detection
- Time varying networks and the weakness of strong ties
- Causality-Driven Slow-Down and Speed-Up of Diffusion in Non-Markovian Temporal Networks
- Random walks and search in time-varying networks
- Temporal Heterogeneities Increase the Prevalence of Epidemics on Evolving Networks
- Betweenness Preference: Quantifying Correlations in the Topological Dynamics of Temporal Networks
- Bursty communication patterns facilitate spreading in a threshold-based epidemic dynamics
- Random Walks on Stochastic Temporal Networks
- Coverage centralities for temporal networks
Cited by in corpus (17)
- Representing higher-order dependencies in networks
- Ranking in evolving complex networks
- Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection
- Sampling of Temporal Networks: Methods and Biases
- Dynamics on networks: competition of temporal and topological correlations
- From Relational Data to Graphs: Inferring Significant Links using Generalized Hypergeometric Ensembles
- HONEM: Learning Embedding for Higher Order Networks
- Data-driven modeling of collaboration networks: A cross-domain analysis
- Modeling social resilience: Questions, answers, open problems
- Vaccination strategies on dynamic networks with indirect transmission links and limited contact information
- Higher-order models capture changes in controllability of temporal networks
- Uncovering hidden dependency in weighted networks via information entropy
- The switching mechanisms of social network densification
- Higher-order temporal network effects through triplet evolution
- Locating Community Smells in Software Development Processes Using Higher-Order Network Centralities
- A method to compute the communicability of nodes through causal paths in temporal networks
- Compressing the chronology of a temporal network with graph commutators