Structure of Neighborhoods in a Large Social Network

We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph that relies on enumeration of small induced subgraphs. We make a step further in this direction by identifying not only subgraphs but also the positions occupied by the different vertices of the graph, being thus able to compute the roles played by the vertices of the graph. We apply this method to the neighborhood of each vertex in a 2.7M vertices, 6M edges mobile phone graph. We analyze how the contacts of each person are connected to each other and the positions they occupy in the neighborhood network. Then we compare the intensity of their communications (duration and frequency) to their positions, finding that the two are notindependent. We finally interpret and explain the results using social studies on phone communications.

[1]  Jon M. Kleinberg,et al.  Inferring Web communities from link topology , 1998, HYPERTEXT '98.

[2]  Marion B. H. Whyte.  Family and Social Network , 1958, Mental Health.

[3]  Priya Mahadevan,et al.  Systematic topology analysis and generation using degree correlations , 2006, SIGCOMM.

[4]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[5]  Sebastian Wernicke,et al.  Efficient Detection of Network Motifs , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[6]  Philip S. Yu,et al.  Mining significant graph patterns by leap search , 2008, SIGMOD Conference.

[7]  Jeremy Boissevain,et al.  Friends of friends : networks, manipulators and coalitions , 1974 .

[8]  Barry Wellman,et al.  An egocentric network tale: comment on Bien et al. (1991) , 1993 .

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

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

[11]  S. Boorman,et al.  Social structure from multiple networks: I , 1976 .

[12]  Olaf Caroe,et al.  Political Leadership among the Swat Pathans , 1960 .

[13]  Etienne Huens,et al.  Geographical dispersal of mobile communication networks , 2008, 0802.2178.

[14]  Ambuj K. Singh,et al.  GraphRank: Statistical Modeling and Mining of Significant Subgraphs in the Feature Space , 2006, Sixth International Conference on Data Mining (ICDM'06).

[15]  James M. Murphy,et al.  Friends of Friends , 2004, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[16]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[17]  H. White,et al.  “Structural Equivalence of Individuals in Social Networks” , 2022, The SAGE Encyclopedia of Research Design.

[18]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[19]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[20]  Zbigniew Smoreda,et al.  Are social networks technologically embedded?: How networks are changing today with changes in communication technology , 2005, Soc. Networks.

[21]  G. Madey,et al.  Uncovering individual and collective human dynamics from mobile phone records , 2007, 0710.2939.

[22]  Caroline Haythornthwaite,et al.  Social networks and Internet connectivity effects , 2005 .

[23]  Matthieu Latapy,et al.  Main-memory triangle computations for very large (sparse (power-law)) graphs , 2008, Theor. Comput. Sci..

[24]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[25]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[26]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[27]  F. Barth,et al.  Political Leadership Among Swat Pathans , 2020 .

[28]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[29]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[30]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[31]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[32]  P. Arabie,et al.  An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling , 1975 .

[33]  S. Borgatti,et al.  The class of all regular equivalences: Algebraic structure and computation☆ , 1989 .

[34]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[35]  Tom A. B. Snijders,et al.  Social Network Analysis , 2011, International Encyclopedia of Statistical Science.

[36]  Vijay V. Raghavan,et al.  The Shape of the Web and Its Implications for Searching the Web , 2000 .

[37]  Z. Smoreda,et al.  Extraction De Reseaux Egocentres Dans Un (Tres Grand) Reseau Social , 2009 .

[38]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[39]  R. Chambers,et al.  Family and social network , 1964 .

[40]  S. Boorman,et al.  Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions , 1976, American Journal of Sociology.

[41]  Dieter Kratsch,et al.  Finding and Counting Small Induced Subgraphs Efficiently , 1995, WG.

[42]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.