Name
Abstract | ||
|---|---|---|
Inspired by socio-political scenarios, like dictatorships, in which a minority of people exercise control over a majority of weakly interconnected individuals, we propose vulnerability and power measures defined on groups of actors of networks. We establish an unexpected connection between network vulnerability and graph regularizability. We use the Shapley value of coalition games to introduce fresh notions of vulnerability and power at node level defined in terms of the corresponding measures at group level. We investigate the computational complexity of computing the defined measures, both at group and node levels, and provide effective methods to quantify them. Finally we test vulnerability and power on both artificial and real networks. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1017/nws.2015.8 | NETWORK SCIENCE |
Keywords | Field | DocType |
centrality measures, robustness, regularizable graphs, 2-vertex cover, 2-matching, integer linear programming, coalitional games, Shapley value | Graph,Mathematical optimization,Shapley value,Robustness (computer science),Integer programming,Artificial intelligence,Mathematics,Machine learning,Computational complexity theory,Vulnerability | Journal |
Volume | Issue | ISSN |
3 | 2 | 2050-1242 |
Citations | PageRank | References |
2 | 0.42 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enrico Bozzo | 1 | 51 | 8.79 |
| Massimo Franceschet | 2 | 658 | 39.91 |
| Franca Rinaldi | 3 | 99 | 14.05 |