Numerical Investigation of Metrics for Epidemic Processes on Graphs
Abstract
This study develops the epidemic hitting time (EHT) metric on graphs measuring the expected time an epidemic starting at node $a$ in a fully susceptible network takes to propagate and reach node $b$. An associated EHT centrality measure is then compared to degree, betweenness, spectral, and effective resistance centrality measures through exhaustive numerical simulations on several real-world network data-sets. We find two surprising observations: first, EHT centrality is highly correlated with effective resistance centrality; second, the EHT centrality measure is much more delocalized compared to degree and spectral centrality, highlighting the role of peripheral nodes in epidemic spreading on graphs.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2015
- DOI:
- 10.48550/arXiv.1511.07893
- arXiv:
- arXiv:1511.07893
- Bibcode:
- 2015arXiv151107893G
- Keywords:
-
- Physics - Physics and Society;
- Computer Science - Social and Information Networks;
- Mathematics - Probability
- E-Print:
- 6 pages, 1 figure, 3 tables, In Proceedings of 2015 Asilomar Conference on Signals, Systems, and Computers