Parallel Random Apollonian Networks

Details Parallel Random Apollonian Networks Parallel Random Apollonian Networks

2009-04-27

arxiv.org/abs/0904.4176v2

Computer Science

Discrete Mathematics

Working paper

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Parallel Random Apollonian Networks 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 Parallel Random Apollonian Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Random Apollonian Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-322974