Monotonicity in Undirected Networks

07/13/2022
by   Paolo Boldi, et al.
0

Is it always beneficial to create a new relationship (have a new follower/friend) in a social network? This question can be formally stated as a property of the centrality measure that defines the importance of the actors of the network. Score monotonicity means that adding an arc increases the centrality score of the target of the arc; rank monotonicity means that adding an arc improves the importance of the target of the arc relatively to the remaining nodes. It is known that most centralities are both score and rank monotone on directed, strongly connected graphs. 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. We show that, surprisingly, the situation in the undirected case is very different, and in particular that closeness, harmonic centrality, betweenness, eigenvector centrality, Seeley's index, Katz's index, and PageRank are not rank monotone; betweenness and PageRank are not even score monotone. In other words, while it is always a good thing to get a new follower, it is not always beneficial to get a new friend.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/02/2022

Spectral Rank Monotonicity on Undirected Networks

We study the problem of score and rank monotonicity for spectral ranking...
research
10/22/2021

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

We initiate the study of k-edge-connected orientations of undirected gra...
research
07/11/2018

Rank of weighted digraphs with blocks

Let G be a digraph and r(G) be its rank. Many interesting results on the...
research
08/29/2021

The Popularity-Homophily Index: A new way to measure Homophily in Directed Graphs

In networks, the well-documented tendency for people with similar charac...
research
06/12/2020

The undirected repetition threshold and undirected pattern avoidance

For a rational number r such that 1<r≤ 2, an undirected r-power is a wor...

Please sign up or login with your details

Forgot password? Click here to reset