Fairness on the web: alternatives to the power law

This paper presents several measures of fairness and inequality based on the degree distribution in networks, as alternatives to the well-established power-law exponent. Networks such as social networks, communication networks and the World Wide Web itself are often characterized by their unequal distribution of edges: Few nodes are attached to many edges, while many nodes are attached to only few edges. The inequality of such network structures is typically measured using the power-law exponent, stating that the number of nodes with a given degree is proportional to that degree taken to a certain exponent. However, this approach has several weaknesses, such as its narrow applicability and expensive computational complexity. Beyond the fact that power laws are by far not a universal phenomenon on the Web, the power-law exponent has the surprising property of being negatively correlated with the usual notion of inequality, making it unintuitive as a fairness measure. As alternatives, we propose several measures based on the Lorenz curve, which is used in economics but rarely in networks study, and on the information-theoretical concept of entropy. We show in experiments on a large collection of online networks that these measures do not suffer under the drawbacks of the power-law exponent.

[1]  Vilfredo Pareto,et al.  Manuale di economia politica : con una introduzione alla scienza sociale , 1906 .

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Yiming Yang,et al.  RCV1: A New Benchmark Collection for Text Categorization Research , 2004, J. Mach. Learn. Res..

[4]  M. E. J. Newman,et al.  Power laws, Pareto distributions and Zipf's law , 2005 .

[5]  M. Newman Power laws, Pareto distributions and Zipf's law , 2005 .

[6]  Daniel A. Keim,et al.  On Knowledge Discovery and Data Mining , 1997 .

[7]  C. Lee Giles,et al.  CiteSeer: an autonomous Web agent for automatic retrieval and identification of interesting publications , 1998, AGENTS '98.

[8]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[9]  Christos Faloutsos,et al.  The "DGX" distribution for mining massive, skewed data , 2001, KDD '01.

[10]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[11]  Yuejin Tan,et al.  A new measure of heterogeneity of complex networks based on degree sequence , 2010 .

[12]  Chonghui Guo,et al.  Entropy optimization of scale-free networks’ robustness to random failures , 2005, cond-mat/0506725.

[13]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[14]  Paolo Avesani,et al.  Controversial Users Demand Local Trust Metrics: An Experimental Study on Epinions.com Community , 2005, AAAI.

[15]  M. McLure One Hundred Years from Today: Vilfredo Pareto, Manuale di Economia Politica con una Introduzione alla Scienza Sociale, Milan: Societa Editrice Libraria. 1906 , 2006 .

[16]  Christian Bauckhage,et al.  The slashdot zoo: mining a social network with negative edges , 2009, WWW.

[17]  Robin Wilson,et al.  Modern Graph Theory , 2013 .

[18]  Hinrich Schütze,et al.  Book Reviews: Foundations of Statistical Natural Language Processing , 1999, CL.

[19]  Gipsi Lima-Mendez,et al.  The powerful law of the power law and other myths in network biology. , 2009, Molecular bioSystems.