On node ranking in graphs
arXiv:2107.09487 · doi:10.1080/00207179.2023.2204969
Abstract
The ranking of nodes in a network according to their ``importance'' is a classic problem that has attracted the interest of different scientific communities in the last decades. The current COVID-19 pandemic has recently rejuvenated the interest in this problem, as it is related to the selection of which individuals should be tested in a population of asymptomatic individuals, or which individuals should be vaccinated first. Motivated by the COVID-19 spreading dynamics, in this paper we review the most popular methods for node ranking in undirected unweighted graphs, and compare their performance in a benchmark realistic network, that takes into account the community-based structure of society. Also, we generalize a classic benchmark network originally proposed by Newman for ranking nodes in unweighted graphs, to show how ranks change in the weighted case.
References in corpus (14)
- Finding and evaluating community structure in networks
- The architecture of complex weighted networks
- A SIDARTHE Model of COVID-19 Epidemic in Italy
- Forecast and Control of Epidemics in a Globalized World
- Influence of fake news in Twitter during the 2016 US presidential election
- Consistency and differences between centrality measures across distinct classes of networks
- Characterizing the dynamical importance of network nodes and links
- Random walks on weighted networks
- Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects
- Post-Lockdown Abatement of COVID-19 by Fast Periodic Switching
- Characterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks
- Analyzing complex networks through correlations in centrality measurements
- Kemeny-based testing for COVID-19
- Random Walks on Complex Networks