_:n161124605ad34361b39f60f438a67c26xb27
<http://schema.org/description>
"We study the problem of score and rank monotonicity for spectral ranking\nmethods, such as eigenvector centrality and PageRank, in the case of undirected\nnetworks. Score monotonicity means that adding an edge increases the score at\nboth ends of the edge. Rank monotonicity means that adding an edge improves the\nrelative position of both ends of the edge with respect to the remaining nodes.\nIt is known that common spectral rankings are both score and rank monotone on\ndirected, strongly connected graphs. We show that, surprisingly, the situation\nis very different for undirected graphs, and in particular that PageRank is\nneither score nor rank monotone."
<http://api.deepai.org/profile/sebastiano-vigna>