An important problem in network analysis is understanding how much nodes are important in order to “propagate” the information across the input network. To this aim, many centrality measures have been proposed in the literature and our main goal here is that of providing an overview of the most important of them. In particular, we distinguish centrality measures based on walks computation from those based on shortest-paths computation. We also provide some examples in order to clarify how these measures can be calculated, with special attention to Degree Centrality, Closeness Centrality and Betweennes Centrality.
Giancarlo, R., Greco, D., Landolina, F., Rombo, S.E. (2017). Network Centralities and Node Ranking. In Reference Module in Life Sciences. Elsevier [10.1016/B978-0-12-809633-8.20425-1].
Network Centralities and Node Ranking
Giancarlo, Raffaele;LANDOLINA, Francesco;Rombo, Simona E.
2017-01-01
Abstract
An important problem in network analysis is understanding how much nodes are important in order to “propagate” the information across the input network. To this aim, many centrality measures have been proposed in the literature and our main goal here is that of providing an overview of the most important of them. In particular, we distinguish centrality measures based on walks computation from those based on shortest-paths computation. We also provide some examples in order to clarify how these measures can be calculated, with special attention to Degree Centrality, Closeness Centrality and Betweennes Centrality.
| File | Dimensione | Formato | |
|---|---|---|---|
|
giancarlo2018.pdf
Solo gestori archvio
Dimensione
290.42 kB
Formato
Adobe PDF
|
290.42 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
