论文信息 - Long Paths in Random Apollonian Networks

Long Paths in Random Apollonian Networks

We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) . We show that with high probability for any constant c < 2/3.

Alan M. Frieze | Colin Cooper | A. Frieze | C. Cooper

[1] Xingxing Yu,et al. Long Cycles in 3-Connected Graphs , 2002, J. Comb. Theory, Ser. B.

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

[3] Pu Gao,et al. On the Longest Paths and the Diameter in Random Apollonian Networks , 2013, Electron. Notes Discret. Math..

[4] Alan M. Frieze,et al. The height of random k‐trees and related branching processes , 2013, Random Struct. Algorithms.

[5] Nicholas C. Wormald,et al. Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees , 2016, J. Appl. Probab..