Finding hierarchy in directed online social networks

Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarchy for different types of networks and at different scales. We adopt the premise that people form connections in a social network based on their perceived social hierarchy; as a result, the edge directions in directed social networks can be leveraged to infer hierarchy. In this paper, we define a measure of hierarchy in a directed online social network, and present an efficient algorithm to compute this measure. We validate our measure using ground truth including Wikipedia notability score. We use this measure to study hierarchy in several directed online social networks including Twitter, Delicious, YouTube, Flickr, LiveJournal, and curated lists of several categories of people based on different occupations, and different organizations. Our experiments on different online social networks show how hierarchy emerges as we increase the size of the network. This is in contrast to random graphs, where the hierarchy decreases as the network size increases. Further, we show that the degree of stratification in a network increases very slowly as we increase the size of the graph.

[1]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[2]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs , 1995, IPCO.

[3]  C. F. Kossack,et al.  Rank Correlation Methods , 1949 .

[4]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[5]  B. Bollobás.  The evolution of random graphs , 1984 .

[6]  Shlomo Hershkop,et al.  Automated social hierarchy detection through email network analysis , 2007, WebKDD/SNA-KDD '07.

[7]  Keith H. Black.  Testing Trade-Off and Pecking Order Predictions about Dividends and Debt , 2002 .

[8]  Stanley Milgram,et al.  An Experimental Study of the Small World Problem , 1969 .

[9]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[10]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[11]  Albert-László Barabási,et al.  The origin of bursts and heavy tails in human dynamics , 2005, Nature.

[12]  Tanya Y. Berger-Wolf,et al.  Inferring the Maximum Likelihood Hierarchy in Social Networks , 2009, 2009 International Conference on Computational Science and Engineering.

[13]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[14]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[15]  Cristopher Moore,et al.  Structural Inference of Hierarchies in Networks , 2006, SNA@ICML.

[16]  H. Vries,et al.  Finding a dominance order most consistent with a linear hierarchy: a new procedure and review , 1998, Animal Behaviour.

[17]  Ernesto Burattini.  Animal Behavior - 3 , 2009 .

[18]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[19]  Michael C. Appleby,et al.  The probability of linearity in hierarchies , 1983, Animal Behaviour.

[20]  Lise Getoor,et al.  Link mining: a survey , 2005, SKDD.

[21]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[22]  Murray Z. Frank,et al.  Testing the Pecking Order Theory of Capital Structure , 2000 .

[23]  Han de Vries,et al.  An improved test of linearity in dominance hierarchies containing unknown or tied relationships , 1995, Animal Behaviour.

[24]  H. Landau.  On dominance relations and the structure of animal societies: I. Effect of inherent characteristics , 1951 .