The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness

Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already have high degree. We use improved concentration bounds for vertex degrees to show that preferential attachment graphs contain asymptotically almost surely (a.a.s.) a one-subdivided clique of size at least $(\log n)^{1/4}$. Therefore, preferential attachment graphs are a.a.s somewhere-dense. This implies that algorithmic techniques developed for sparse graphs are not directly applicable to them. The concentration bounds state: Assuming that the exact degree $d$ of a fixed vertex (or set of vertices) at some early time $t$ of the random process is known, the probability distribution of $d$ is sharply concentrated as the random process evolves if and only if $d$ is large at time $t$.

[1]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[2]  Jaroslav Nesetril,et al.  Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.

[3]  Philippe Flajolet,et al.  Some exactly solvable models of urn process theory , 2006 .

[4]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

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

[6]  M. Kamrul Hassan,et al.  Dynamic scaling, data-collapse and self-similarity in Barabási–Albert networks , 2011, ArXiv.

[7]  Aaron Clauset,et al.  Scale-free networks are rare , 2018, Nature Communications.

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

[9]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks: Volume 1 , 2016 .

[10]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion I. Decompositions , 2008, Eur. J. Comb..

[11]  Kevin Zhou.  Navigation in a small world , 2017 .

[12]  Stephan Kreutzer,et al.  Neighborhood complexity and kernelization for nowhere dense classes of graphs , 2016, ICALP.

[13]  Stephan Kreutzer,et al.  Deciding first-order properties of nowhere dense graphs , 2013, STOC.

[14]  Hosam M. Mahmoud,et al.  Polya Urn Models , 2008 .

[15]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[16]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

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

[18]  Nicole Schweikardt,et al.  First-Order Query Evaluation with Cardinality Conditions , 2017, PODS.

[19]  Basile Morcrette,et al.  Fully Analyzing an Algebraic Pólya Urn Model , 2012, LATIN.

[20]  Linda Farczadi,et al.  On the degree distribution of a growing network model , 2014 .

[21]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[22]  Amin Saberi,et al.  Asymptotic behavior and distributional limits of preferential attachment graphs , 2014, 1401.2792.

[23]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

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

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

[26]  V. Eguíluz,et al.  Growing scale-free networks with small-world behavior. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[28]  Blair D. Sullivan,et al.  Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms , 2014, ArXiv.

[29]  Dimitrios M. Thilikos,et al.  (Meta) Kernelization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.