Parallel Random Apollonian Networks

We present and study in this paper a simple algorithm that produces so called growing Parallel Random Apollonian Networks (P-RAN) in any dimension d. Analytical derivations show that these networks still exhibit small-word and scale-free characteristics. To characterize further the structure of P-RA...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2009-04
Main Authors: Bonnel, Nicolas, Pierre-François Marteau, Ménier, Gildas G
Format: Article
Language:English
Subjects:
Algorithms
Apexes
Clustering
Computer simulation
Mathematical analysis
Networks
Upper bounds
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present and study in this paper a simple algorithm that produces so called growing Parallel Random Apollonian Networks (P-RAN) in any dimension d. Analytical derivations show that these networks still exhibit small-word and scale-free characteristics. To characterize further the structure of P-RAN, we introduce new parameters that we refer to as the parallel degree and the parallel coefficient, that determine locally and in average the number of vertices inside the (d+1)-cliques composing the network. We provide analytical derivations for the computation of the degree and parallel degree distributions, parallel and clustering coefficients. We give an upper bound for the average path lengths for P-RAN and finally show that our derivations are in very good agreement with our simulations.
ISSN:2331-8422