Name
Abstract | ||
|---|---|---|
A network is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. We define a hierarchy of four network classes in terms of their regularization properties. For the classes of the hierarchy, we investigate structural conditions on both the network and the corresponding adjacency matrix that are necessary and sufficient for the inclusion of a network in the class. Moreover, we provide an algorithmic solution for the problem of positioning a network in the hierarchy. We argue that the regularization solution is useful to build an egalitarian, friction-free network in which all actors of the network has the same centrality (and power). |
Year | Venue | DocType |
|---|---|---|
2016 | CoRR | Journal |
Volume | Citations | PageRank |
abs/1608.06427 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Massimo Franceschet | 1 | 658 | 39.91 |
| Enrico Bozzo | 2 | 51 | 8.79 |