Higher-Order Aggregate Networks in the Analysis of Temporal Networks: Path structures and centralities

August 26, 2015 Β· Declared Dead Β· πŸ› European Physical Journal B : Condensed Matter Physics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ingo Scholtes, Nicolas Wider, Antonios Garas arXiv ID 1508.06467 Category physics.soc-ph Cross-listed cs.SI Citations 95 Venue European Physical Journal B : Condensed Matter Physics Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted