Measuring the shape of degree distributions

Similar documents
Measuring the shape of degree distributions: A commentary

Network models: random graphs

6.207/14.15: Networks Lecture 12: Generalized Random Graphs

Erzsébet Ravasz Advisor: Albert-László Barabási

CS224W: Analysis of Networks Jure Leskovec, Stanford University

arxiv: v1 [physics.soc-ph] 15 Dec 2009

Deterministic scale-free networks

Complex-Network Modelling and Inference

Networks as a tool for Complex systems

Network models: dynamical growth and small world

Social Networks- Stanley Milgram (1967)

The architecture of complexity: the structure and dynamics of complex networks.

Shlomo Havlin } Anomalous Transport in Scale-free Networks, López, et al,prl (2005) Bar-Ilan University. Reuven Cohen Tomer Kalisky Shay Carmi

Power laws. Leonid E. Zhukov

The Beginning of Graph Theory. Theory and Applications of Complex Networks. Eulerian paths. Graph Theory. Class Three. College of the Atlantic

A LINE GRAPH as a model of a social network

Chapter 2 Fitness-Based Generative Models for Power-Law Networks

Mini course on Complex Networks

1 Complex Networks - A Brief Overview

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 4 May 2000

ECS 253 / MAE 253 April 26, Intro to Biological Networks, Motifs, and Model selection/validation

Evolving network with different edges

Opinion Dynamics on Triad Scale Free Network

Variance estimation for Generalized Entropy and Atkinson indices: the complex survey data case

arxiv: v1 [cs.si] 1 Jul 2014

The Friendship Paradox in Scale-Free Networks

Random Networks. Complex Networks CSYS/MATH 303, Spring, Prof. Peter Dodds

Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks

Chaos, Complexity, and Inference (36-462)

On Resolution Limit of the Modularity in Community Detection

Power Laws & Rich Get Richer

Data Mining and Analysis: Fundamental Concepts and Algorithms

Modeling of Growing Networks with Directional Attachment and Communities

Growing a Network on a Given Substrate

Chaos, Complexity, and Inference (36-462)

poster presented at: Complex Networks: from Biology to Information Technology Pula (CA), Italy, July 2-6, 2007

Self Similar (Scale Free, Power Law) Networks (I)

Fractal dimensions ofpercolating networks

Cross over of recurrence networks to random graphs and random geometric graphs

Spectral Analysis of Directed Complex Networks. Tetsuro Murai

How Scale-free Type-based Networks Emerge from Instance-based Dynamics

Overview of Network Theory

Cell biology traditionally identifies proteins based on their individual actions as catalysts, signaling

networks in molecular biology Wolfgang Huber

A Modified Earthquake Model Based on Generalized Barabási Albert Scale-Free

Universal dependence of distances on nodes degrees in complex networks

Graph Theory and Networks in Biology

Scale-Free Networks. Outline. Redner & Krapivisky s model. Superlinear attachment kernels. References. References. Scale-Free Networks

Information Propagation Analysis of Social Network Using the Universality of Random Matrix

Reaction diffusion processes on random and scale-free networks

Bioinformatics I. CPBS 7711 October 29, 2015 Protein interaction networks. Debra Goldberg

Overview. Overview. Social networks. What is a network? 10/29/14. Bioinformatics I. Networks are everywhere! Introduction to Networks

Generating and analyzing spatial social networks

Network landscape from a Brownian particle s perspective

ECS 289 / MAE 298 May 8, Intro to Biological Networks, Motifs, and Model selection/validation

arxiv: v1 [nlin.cg] 23 Sep 2010

Enhancing synchronizability of weighted dynamical networks. using betweenness centrality

Lecture notes for /12.586, Modeling Environmental Complexity. D. H. Rothman, MIT October 20, 2014

Self-organized scale-free networks

Random Networks. Complex Networks, CSYS/MATH 303, Spring, Prof. Peter Dodds

arxiv:cond-mat/ v2 [cond-mat.stat-mech] 29 Apr 2008

Combining Geographic and Network Analysis: The GoMore Rideshare Network. Kate Lyndegaard

The Spreading of Epidemics in Complex Networks

Complex networks: an introduction

Eigenvalues of Random Power Law Graphs (DRAFT)

Chapter 8: The Topology of Biological Networks. Overview

Spectral Graph Theory Tools. Analysis of Complex Networks

Networks. Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource

An evolving network model with community structure

Network Biology: Understanding the cell s functional organization. Albert-László Barabási Zoltán N. Oltvai

MEASURING THE SOCIO-ECONOMIC BIPOLARIZATION PHENOMENON

Deterministic Decentralized Search in Random Graphs

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 8 Jun 2004

Degree Distribution: The case of Citation Networks

. p.1. Mathematical Models of the WWW and related networks. Alan Frieze

Evolutionary dynamics on graphs

A new centrality measure for probabilistic diffusion in network

Exponential random graph models for the Japanese bipartite network of banks and firms

Directed Scale-Free Graphs

The network growth model that considered community information

Modeling Dynamic Evolution of Online Friendship Network

Self-organized Criticality in a Modified Evolution Model on Generalized Barabási Albert Scale-Free Networks

The Measurement of Inequality, Concentration, and Diversification.

Link Prediction. Eman Badr Mohammed Saquib Akmal Khan

arxiv:physics/ v1 [physics.soc-ph] 14 Dec 2006

Kristina Lerman USC Information Sciences Institute

Overview course module Stochastic Modelling

arxiv:cond-mat/ v2 [cond-mat.stat-mech] 3 Oct 2005

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 24 Mar 2005

arxiv:physics/ v2 [physics.soc-ph] 19 Feb 2007

arxiv:physics/ v2 [physics.soc-ph] 9 Feb 2007

Adventures in random graphs: Models, structures and algorithms

preferential attachment

Dynamic Scaling, Data-collapse and Self-Similarity in Mediation-Driven Attachment Networks

Numerical evaluation of the upper critical dimension of percolation in scale-free networks

Power-law index and its application based on the degree of distribution and scale-free network evolution

Temporal patterns in information and social systems

Biological Networks. Gavin Conant 163B ASRC

Evolution of a social network: The role of cultural diversity

How to count trees? arxiv:cond-mat/ v3 [cond-mat.stat-mech] 7 Apr 2005

Transcription:

Measuring the shape of degree distributions Dr Jennifer Badham Visiting Fellow SEIT, UNSW Canberra research@criticalconnections.com.au

Overview Context What does shape mean for degree distribution Why measure it? Compare Characterise Relationship with other properties No agreed measure Candidates to compare Variance / standard deviation / coefficient of variation Power law exponent Centralisation Gini coefficient

Variance (and its variants) Standard measure in statistics Width of peak Distance from mean Coefficient of variation (V k ) is scale invariant Snijders (1981) applied to degree V 1 N 2 k N i1 i k k 1 N k k N i1 k 2 k 2 i 2 k

Power law exponent Parameter of fitted distribution Fitted to tail only How quickly degree probability declines Long tail with small Only for very large, skewed (eg WWW) Poor fitting (Clauset et al 2009) p Ck k k 0

Centralisation Network specific measure Extent to which most central node is more central than others Centrality = degree Only k max and k considered Freeman (1978); Butts (2006) C kmax k k ( N 2) min N 1 k, 2

Gini coefficient Standard in equality measure for income Interpretations: Expected difference in degree for random pair of nodes Total distance from equality (Lorenz) Limited attention from SNA (except Hu & Wang 2008) N N 1 1 G k k G 2 k 2N i1 j1 12 A L L : x p y kp A k A k k0 k0 i A j

Example networks (diverse) Empirical Friends: school Yeast: protein interactions Collaborators: condensed matter archive WWW: hyperlinks Artificial BA1000: preferential attachment ER1000: fixed probability of edge Star1000: star with 1000 nodes

Example networks: distribution

Example networks: distribution

Comparison: example networks

Example networks: Lorenz curves

Shape measure principles Objective is comparability: Must be sensible for all potential degree distribution shapes Relevant principles drawn from systematic evaluation for income inequality (Cowell 2000) Transfer: Moving edges from high degree node to lower degree node reduces inequality (no reversal) Addition: Increase all nodes by same number of edges should reduce (relative) or maintain (absolute) inequality Replication: Multiple copies of all nodes has no effect

Comparison: principles

Conclusion Only Gini (G) and Coefficient of Variation (V k ) meet principles Centralisation unresponsive to transfers Power law cannot always be fitted V k not meaningful for skewed distributions, researchers use for networks, G for income G intuitive mathematically (difference) and graphically (comparison to equality) Also relevant to other distributions (eg shortest path, betweenness, clustering coefficient)

References (measures) Butts CT. Exact bounds for degree centralization. Social Networks 2006; 28:283-96. Clauset A, Shalizi CR, Newman MEJ. Power-law distributions in empirical data. SIAM Review 2009; 51(4):661-703. Cowell FA. Measurement of inequality. In: Atkinson AB, Bourguignon F, eds. Handbook of Income Distribution: Elsevier; 2000. p. 87-166. Freeman LC. Centrality in social networks: conceptual clarification. Social Networks 1978; 1:215-39. Hu HB, Wang XF. Unified index to quantifying heterogeneity of complex networks. Physica A: Statistical Mechanics and its Applications 2008; 387(14):3769-80. Snijders TAB. The degree variance: An index of graph heterogeneity. Social Networks 1981; 3(3):163-74.

References (example networks) Friends: Rapoport A, Horvath WJ. A study of a large sociogram. Behavioral Science 1961; 6(4):279-91. Yeast: Jeong H, Mason SP, Barabási A-L, Oltvai ZN. Lethality and centrality in protein networks. Nature 2001; 411(6833):41-42. Collaborators: Newman MEJ. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the United States of America 2001; 98:404-09. WWW: Albert R, Jeong H, Barabási A-L. Diameter of the World Wide Web. Nature 1999; 401(9 September 1999):130-31. BA1000: Barabási A-L, Albert R. Emergence of scaling in random networks. Science 1999; 286(5439):509-12. ER1000: Erdös P, Rényi A. On the evolution of random graphs. Publications of the Institute of Mathematics, Hungarian Academy of Science 1960; 5:17-60.