Distances in random Apollonian network structures

Details Distances in random Apollonian network structures Distances in random Apollonian network structures

2007-12-13

arxiv.org/abs/0712.2129v1

Mathematics

Combinatorics

12 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distances in random Apollonian network structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distances in random Apollonian network structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distances in random Apollonian network structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-622984