Controlling centrality: The inverse ranking problem for spectral centralities of complex networks
In this paper, some results about the controllability of spectral centrality in a complex network are presented. In particular, the inverse problem of designing an unweigthed graph with a prescribed centrality is considered. We show that for every possible ranking, eventually with ties, an unweighted directed/undirected complex network can be found whose PageRank or eigenvector centrality gives the ranking considered. Different families of networks are presented in order to analytically solve this problem either for directed and undirected graphs with and without loops.
© 2022 The Authors. Mathematical Methods in the Applied Sciences published by John Wiley & Sons Ltd.https://doi.org/10.1002/mma.8478
- Artículos de Revista