Long Paths in Random Apollonian Networks

From MaRDI portal



Abstract: We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) calAn. We show that w.h.p. L(n)leqne−logcn for any constant c<2/3.











This page was built for publication: Long Paths in Random Apollonian Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985790)