Search Results for author:
Found 2 papers, 1 papers with code
Monotonicity in Undirected Networks
In this paper, we study the problem of score and rank monotonicity for classical centrality measures in the case of undirected networks: in this case, we require that score, or relative importance, improve at both endpoints of the new edge.
Spectral Rank Monotonicity on Undirected Networks
We show that, surprisingly, the situation is very different for undirected graphs, and in particular that PageRank is neither score nor rank monotone.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
