MSP-N: Multiple selection procedure with ‘N’ possible growth mechanisms

Network modeling is a challenging task due to non-trivial evolution dynamics. We introduce multiple-selection-procedure with ‘N’ possible growth mechanisms (MSP-N). In MSP-N, an incoming node chooses a single option among N available options to link to pre-existing nodes. Some of the potential options, in case of social networks, can be standard preferential or random attachment and node aging or fitness. In this paper, we discuss a specific case, MSP-2, and shows its efficacy in reconstructing several non-trivial characteristic properties of social networks, including networks with power-law degree distribution, power-law with an exponential decay (exponential cut-off), and exponential degree distributions. We evaluate the proposed evolution mechanism over two real-world networks and observe that the generated networks highly resembles the degree distribution of the real-world networks. Besides, several other network properties such as high clustering and triangle count, low spectral radius, and community structure, of the generated networks are significantly closer to the real-world networks.

[1]  A. Bonato.  RANDOM GRAPH MODELS FOR THE WEB GRAPH , 2007 .

[2]  Pradumn Kumar Pandey,et al.  A Parametric Model Approach for Structural Reconstruction of Scale-Free Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.

[3]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[4]  Srinivasan Parthasarathy,et al.  An ensemble framework for clustering protein-protein interaction networks , 2007, ISMB/ECCB.

[5]  Sergey N. Dorogovtsev,et al.  Ising Model on Networks with an Arbitrary Distribution of Connections , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Han Zhu,et al.  Effect of aging on network structure. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[8]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[9]  S. Bornholdt,et al.  Topological evolution of dynamical networks: global criticality from local dynamics. , 2000, Physical review letters.

[10]  A. Jamakovic,et al.  Characterization of complex networks: Application to robustness analysis , 2008 .

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

[12]  Yves Zenou,et al.  From Assortative to Dissortative Networks: The Role of Capacity Constraints , 2010, Adv. Complex Syst..

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

[14]  S N Dorogovtsev,et al.  Effect of the accelerating growth of communications networks on their structure. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[17]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[18]  G. Cecchi,et al.  Scale-free brain functional networks. , 2003, Physical review letters.

[19]  Lada A. Adamic,et al.  Internet: Growth dynamics of the World-Wide Web , 1999, Nature.

[20]  Gabrielle Demange,et al.  A Survey of Network Formation Models: Stability and Efficiency , 2005 .

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

[22]  P. Battiston.  Constrained Network Formation , 2016 .

[23]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[24]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

[25]  Jianmin Wu,et al.  Integrated network analysis platform for protein-protein interactions , 2009, Nature Methods.

[26]  H. Ohtsuki,et al.  A simple rule for the evolution of cooperation on graphs and social networks , 2006, Nature.

[27]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[28]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[29]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Jean-Loup Guillaume,et al.  Fast unfolding of community hierarchies in large networks , 2008, ArXiv.

[31]  S. N. Dorogovtsev,et al.  Evolution of networks with aging of sites , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[32]  H. Simon,et al.  ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS , 1955 .

[33]  K. Christensen,et al.  Evolution of Random Networks , 1998 .

[34]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

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

[36]  Jeffery R. Westbrook,et al.  A Functional Approach to External Graph Algorithms , 1998, Algorithmica.

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

[38]  Gueorgi Kossinets,et al.  Empirical Analysis of an Evolving Social Network , 2006, Science.

[39]  Derek de Solla Price,et al.  A general theory of bibliometric and other cumulative advantage processes , 1976, J. Am. Soc. Inf. Sci..

[40]  M. Slikker,et al.  Network Formation Models With Costs for Establishing Links , 1999 .

[41]  K. Kaski,et al.  A Model For Social Networks , 2006, physics/0601114.

[42]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[43]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[44]  Neo D. Martinez.  Artifacts or Attributes? Effects of Resolution on the Little Rock Lake Food Web , 1991 .

[45]  Animesh Mukherjee,et al.  Sic Transit Gloria Manuscriptum: Two Views of the Aggregate Fate of Ancient Papers , 2015, ArXiv.

[46]  Christos Faloutsos,et al.  R-MAT: A Recursive Model for Graph Mining , 2004, SDM.

[47]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[48]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[49]  S. N. Dorogovtsev,et al.  Size-dependent degree distribution of a scale-free growing network. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[50]  Pradumn Kumar Pandey,et al.  Context dependent preferential attachment model for complex networks , 2015, ArXiv.

[51]  Dale Schuurmans,et al.  Modular Community Detection in Networks , 2011, IJCAI.

[52]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

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

[54]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[55]  M. Huxham,et al.  Do Parasites Reduce the Chances of Triangulation in a Real Food Web , 1996 .

[56]  Animesh Mukherjee,et al.  Relay-Linking Models for Prominence and Obsolescence in Evolving Networks , 2016, KDD.

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

[58]  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.

[59]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.