Distances in random Apollonian network structures
Combinatorics
2007-12-14 v1
Abstract
In this paper, we study the distribution of distances in random Apollonian network structures (RANS), a family of graphs which has a one-to-one correspondence with planar ternary trees. Using multivariate generating functions that express all information on distances, and singularity analysis for evaluating the coefficients of these functions, we describe the distribution of distances to an outermost vertex, and show that the average value of the distance between any pair of vertices in a RANS of order n is asymptotically square root of n.
Keywords
Cite
@article{arxiv.0712.2129,
title = {Distances in random Apollonian network structures},
author = {Olivier Bodini and Alexis Darrasse and Michèle Soria},
journal= {arXiv preprint arXiv:0712.2129},
year = {2007}
}
Comments
12 pages