Local Clustering Coefficient in Generalized Preferential Attachment Models

In this paper, we analyze the local clustering coefficient of preferential attachment models. A general approach to preferential attachment was introduced in earlier, where a wide class of models (PA-class) was defined in terms of constraints that are sufficient for the study of the degree distribution and the clustering coefficient. It was previously shown that the degree distribution in all models of the PA-class follows a power law. Also, the global clustering coefficient was analyzed and a lower bound for the average local clustering coefficient was obtained. We expand the results by analyzing the local clustering coefficient for the PA-class of models. Namely, we analyze the behavior of C(d) which is the average local clustering for the vertices of degree d.

[1]  M. Newman.  Power laws, Pareto distributions and Zipf's law , 2005 .

[2]  Albert-László Barabási,et al.  Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Deryk Osthus,et al.  Popularity based random graph models leading to a scale-free degree sequence , 2004, Discret. Math..

[4]  G. Caldarelli,et al.  Assortative model for social networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Liudmila Ostroumova,et al.  Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient , 2012, WAW.

[6]  Tao Zhou,et al.  Maximal planar networks with large clustering coefficient and power-law degree distribution. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[8]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Marián Boguñá,et al.  Clustering in complex networks. II. Percolation properties. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

[12]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

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

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

[15]  Christos Faloutsos,et al.  Dynamics of large networks , 2008 .

[16]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[17]  Marián Boguñá,et al.  Clustering in complex networks. I. General formalism. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[19]  Shashank Khandelwal,et al.  Exploring biological network structure with clustered random networks , 2009, BMC Bioinformatics.

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

[21]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[22]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[23]  Sanjeev Khanna,et al.  The Power of Local Information in Social Networks , 2012, WINE.

[24]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

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

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

[27]  János Kertész,et al.  Clustering in complex networks , 2004 .

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