A method to compute the communicability of nodes through causal paths in temporal networks
arXiv:2108.02664 · doi:10.1016/j.physa.2022.126965
Abstract
We present a method aimed to compute the communicability (broadcast and receive) of nodes through causal paths in temporal networks. The method considers all possible combinations of chronologically ordered products of adjacency matrices of the network snapshots and by means of a damping procedure favors the paths that have high communication efficiency. We apply the method to four real-world networks of face-to-face human contacts and identify the nodes with high communicability. The accuracy of the method is proved by studying the spread of an epidemic in the networks using the susceptible-infected-recovered model. We show that if a node with high broadcast is chosen as the origin of the outbreak of infection then the epidemic spreads early while it is delayed and inhibited if the origin of infection is a node with low broadcast. Receiving nodes can be treated as broadcasters if the arrow of time is reversed.
arXiv comment21 pages, 8 figures
References in corpus (10)
- Temporal Networks
- Dynamics of person-to-person interactions from distributed RFID sensor networks
- High resolution dynamical mapping of social interactions with active RFID
- Memory in network flows and its effects on spreading dynamics and community detection
- Contact patterns among high school students
- Causality-Driven Slow-Down and Speed-Up of Diffusion in Non-Markovian Temporal Networks
- Can co-location be used as a proxy for face-to-face contacts?
- A User-Friendly Hybrid Sparse Matrix Class in C++
- Higher-Order Aggregate Networks in the Analysis of Temporal Networks: Path structures and centralities
- Explicit and implicit network connectivity: Analytical formulation and application to transport processes