On the Longest Paths and the Diameter in Random Apollonian Networks

We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at random, add a vertex inside that face and join it to the vertices of the face. After n−3 steps, we obtain a random triangulated plane graph with n vertices, which is called a Random Apollonian Network (RAN). We show that asymptotically almost surely (a.a.s.) every path in a RAN has length o(n), refuting a conjecture of Frieze and Tsourakakis. We also show that a RAN always has a path of length (2n−5)log2/log3, and that the expected length of its longest path is Ω(n0.88). Finally, we prove that a.a.s. the diameter of a RAN is asymptotic to clogn, where c≈1.668 is the solution of an explicit equation.

[1]  Béla Bollobás,et al.  Handbook of large-scale random networks , 2008 .

[2]  Jonathan P K Doye,et al.  Self-similar disk packings as model spatial scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  G. Fertin,et al.  High-dimensional Apollonian networks , 2005, cond-mat/0503316.

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

[5]  Hosam M. Mahmoud,et al.  Polya Urn Models and Connections to Ran- dom Trees: A Review , 2003 .

[6]  M. Drmota Random Trees: An Interplay between Combinatorics and Probability , 2009 .

[7]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[8]  Michael Drmota,et al.  The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees , 2006, Algorithmica.

[9]  J. Marckert,et al.  Some families of increasing planar maps , 2007, 0712.0593.

[10]  Linyuan Lu,et al.  Complex Graphs and Networks (CBMS Regional Conference Series in Mathematics) , 2006 .

[11]  Alan M. Frieze,et al.  On Certain Properties of Random Apollonian Networks , 2012, WAW.

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

[13]  G. Pólya,et al.  Über die Statistik verketteter Vorgänge , 1923 .

[14]  Anthony Bonato,et al.  A Survey of Models of the Web Graph , 2004, CAAN.

[15]  P. Rousseeuw,et al.  Wiley Series in Probability and Mathematical Statistics , 2005 .

[16]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[17]  W. Rudin Principles of mathematical analysis , 1964 .

[18]  Anthony Bonato,et al.  A course on the Web graph , 2008 .

[19]  Luc Devroye,et al.  Large Deviations for the Weighted Height of an Extended Class of Trees , 2006, Algorithmica.

[20]  Edoardo M. Airoldi,et al.  A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..

[21]  Muhittin Mungan,et al.  Comment on "Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs". , 2011, Physical review letters.

[22]  J. S. Andrade,et al.  Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs. , 2004, Physical review letters.