High dimensional random Apollonian networks

Abstract

We propose a simple algorithm which produces a new category of networks, high dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and clustering coefficients which are determined by the dimension of the network. The values obtained for these parameters are in good agreement with simulation results and comparable to those coming from real networks. We prove also analitically that the average path length of the networks increases at most logarithmically with the number of vertices.

References in corpus (31)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Lethality and centrality in protein networks
• The structure of scientific collaboration networks
• The diameter of the world wide web
• The large-scale organization of metabolic networks
• Evolution of networks
• Classes of behavior of small-world networks
• Mean-field theory for scale-free random networks
• Hierarchical Organization in Complex Networks
• Breakdown of the Internet under intentional attack
• The Web of Human Sexual Contacts
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Topology of evolving networks: local events and universality
• Connectivity of Growing Random Networks
• Organization of Growing Random Networks
• Pseudofractal Scale-free Web
• Deterministic Scale-Free Networks
• Evolution of reference networks with aging
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Scaling Behaviour of Developing and Decaying Networks
• A Geometric Fractal Growth Model for Scale Free Networks
• Self-similar disk packings as model spatial scale-free networks
• Recursive graphs with small-world scale-free properties
• Deterministic Small-World Networks
• Exact scaling properties of a hierarchical network model
• Comment on "Breakdown of the Internet under Intentional Attack"
• Integer Networks
• Synchronous and Asynchronous Recursive Random Scale-Free Nets
• Random Apollonian Networks

Cited by in corpus (36)

• Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity
• Network geometry with flavor: from complexity to quantum geometry
• Weighted Growing Simplicial Complexes
• Simplicial complexes: higher-order spectral dimension and dynamics
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Evolving Apollonian Networks with Small-world Scale-free topologies
• A general geometric growth model for pseudofractal scale-free web
• Exact analytical solution of average path length for Apollonian networks
• Random Sierpinski network with scale-free small-world and modular structure
• The spectral dimension of simplicial complexes: a renormalization group theory
• Complex network view of evolving manifolds
• Evolving small-world scale-free networks consist of cliques
• Geographical networks evolving with optimal policy
• Local-world evolving networks with tunable clustering
• Correlations in random Apollonian network
• A unified model for Sierpinski networks with scale-free scaling and small-world effect
• The higher-order spectrum of simplicial complexes: a renormalization group approach
• Dynamics and Processing in Finite Self-Similar Networks
• Generalized open quantum walks on Apollonian networks
• Planar unclustered scale-free graphs as models for technological and biological networks
• From regular to growing small-world networks
• Synchronous and Asynchronous Recursive Random Scale-Free Nets
• Phase transition in the rich-get-richer mechanism due to finite-size effects
• Geographical networks stochastically constructed by a self-similar tiling according to population
• Vertex labeling and routing in expanded Apollonian networks
• Degree and component size distributions in generalized uniform recursive tree
• Deterministic scale-free networks created in a recursive manner
• An approximative calculation of the fractal structure in self-similar tilings
• Degrees and distances in random and evolving Apollonian networks
• Nearest-neighbour directed random hyperbolic graphs
• The Number of Spanning Trees in Apollonian Networks
• Simple Derivation of the Lifetime and the Distribution of Faces for a Binary Subdivision Model
• Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network
• Wheel Random Apollonian Graphs
• Scale-free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks
• Adaptive Fractal-like Network Structure for Efficient Search of Inhomogeneously Distributed Targets at Unknown Positions