Diameter of P.A. random graphs with edge‐step functions

[1]  The power of choice combined with preferential attachement , 2014, 1403.4301.

[2]  R. Durrett,et al.  Contact processes on random graphs with power law degree distributions have critical value 0 , 2009, 0912.1699.

[3]  Remco van der Hofstad,et al.  Diameters in Preferential Attachment Models , 2007, 0705.4153.

[4]  Steffen Dereich,et al.  Robust Analysis of Preferential Attachment Models with Fitness , 2013, Combinatorics, Probability and Computing.

[5]  Rodrigo Ribeiro,et al.  Large Communities in a Scale-Free Network , 2015, 1509.04650.

[6]  T. F. Móri,et al.  Asymptotic properties of a random graph with duplications , 2015 .

[7]  Alan M. Frieze,et al.  A general model of web graphs , 2003, Random Struct. Algorithms.

[8]  Nicole Eggemann,et al.  The clustering coefficient of a scale-free random graph , 2008, Discret. Appl. Math..

[9]  Peter Morters,et al.  Spatial preferential attachment networks: Power laws and clustering coefficients , 2012, 1210.3830.

[10]  Emmanuel Jacob,et al.  The contact process on scale-free networks evolving by vertex updating , 2017, Royal Society Open Science.

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

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

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

[14]  Nikolaos Fountoulakis,et al.  A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs , 2018, Random Struct. Algorithms.