Distances in random Apollonian network structures

zbMATH Open1393.05247arXiv0712.2129MaRDI QIDQ4584045FDOQ4584045

Alexis Darrasse, Michèle Soria, Olivier Bodini

Publication date: 29 August 2018

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.

Full work available at URL: https://arxiv.org/abs/0712.2129

Recommendations

• Degrees and distances in random and evolving Apollonian networks
• On longest paths and diameter in random Apollonian networks
• Degree distribution of random Apollonian network structures and Boltzmann sampling
• Some properties of random Apollonian networks
• On certain properties of random Apollonian networks

zbMATH Keywords

distanceformal power seriesrandom networkssingularity analysis

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)

Cited In (11)

• Some Properties of Random Apollonian Networks
• Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
• The structure of distances in networks
• Long Paths in Random Apollonian Networks
• A characterization of some graphs with metric dimension two
• Degrees and distances in random and evolving Apollonian networks
• Title not available (Why is that?)
• Distance-sum heterogeneity in graphs and complex networks
• Connected spatial networks over random points and a route-length statistic
• Formulae and Asymptotics for Coefficients of Algebraic Functions
• Distance distributions for graphs modeling computer networks

This page was built for publication: Distances in random Apollonian network structures

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