A clique-superposition model for social networks

How does a social network evolve? Sociologists have studied this question for many years. According to some famous sociologists, social links are driven by social intersections. Actors who affiliate with the shared intersections tend to become interpersonally linked and form a cluster. In the social network, an actor cluster could be a clique or a group of several smaller-sized cliques. Thus we can conclude that a social network is composed of superposed cliques of different sizes. However, sociologists did not verify the theory in large scale data due to lack of computing ability. Motivated by this challenge, incorporated with the theory, we utilize data mining technologies to study the evolution patterns of large scale social networks in real world. Then, we propose a novel Clique-superposition generative model, which generates undirected weighted networks. By extensive experiments, we demonstrate that our model can generate networks with static and time evolving patterns observed not only in earlier literature but also in our work.

[1]  Jean-Loup Guillaume,et al.  Bipartite graphs as models of complex networks , 2006 .

[2]  Jon M. Kleinberg,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World [Book Review] , 2013, IEEE Technol. Soc. Mag..

[3]  Kaile Su,et al.  EWLS: A New Local Search for Minimum Vertex Cover , 2010, AAAI.

[4]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[5]  Yang Lu,et al.  Analyzing user's book-loan behaviors in Peking university library from social network perspective , 2009, JCDL '09.

[6]  G. B. A. Barab'asi.  Competition and multiscaling in evolving networks , 2000, cond-mat/0011029.

[7]  Jure Leskovec,et al.  Microscopic evolution of social networks , 2008, KDD.

[8]  S. Feld.  The Focused Organization of Social Ties , 1981, American Journal of Sociology.

[9]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[10]  John Scott.  What is social network analysis , 2010 .

[11]  Christos Faloutsos,et al.  Weighted graphs and disconnected components: patterns and a generator , 2008, KDD.

[12]  Sougata Mukherjea,et al.  Analyzing the Structure and Evolution of Massive Telecom Graphs , 2008, IEEE Transactions on Knowledge and Data Engineering.

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

[14]  Jon M. Kleinberg,et al.  The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.

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

[16]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[17]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[18]  Christos Faloutsos,et al.  Large human communication networks: patterns and a utility-driven generator , 2009, KDD.

[19]  Tobias Bjerregaard,et al.  A survey of research and practices of Network-on-chip , 2006, CSUR.

[20]  Lada A. Adamic,et al.  A social network caught in the Web , 2003, First Monday.

[21]  Ravi Kumar,et al.  Extracting Large-Scale Knowledge Bases from the Web , 1999, VLDB.

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

[23]  Ravi Kumar,et al.  Trawling the Web for Emerging Cyber-Communities , 1999, Comput. Networks.

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

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

[26]  Lise Getoor,et al.  Co-evolution of social and affiliation networks , 2009, KDD.

[27]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[28]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[29]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[30]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[31]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

[32]  David Bañeres,et al.  The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers , 2010, J. Satisf. Boolean Model. Comput..

[33]  Christos Faloutsos,et al.  Graph mining: Laws, generators, and algorithms , 2006, CSUR.