Random Apollonian Networks

Details Random Apollonian Networks Random Apollonian Networks

2004-09-16

arxiv.org/abs/cond-mat/0409414v2

Physics

Condensed Matter

Disordered Systems and Neural Networks

4 pages, 5 figures

Scientific paper

In this letter, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf Random Apollonian Networks}(RANs) as they can be considered as a variation of Apollonian networks. We obtain the analytic result of power-law exponent $\gamma =3$ and clustering coefficient $C={46/3}-36\texttt{ln}{3/2}\approx 0.74$, which agree very well with the simulation results. We prove that the increasing tendency of average distance of RAN is a little slower than the logarithm of the number of nodes in RAN. Since many real-life networks are both scale-free and small-world, RANs may perform well in mimicking the reality. The epidemic spreading process is also studied, we find that the diseases spread slower in RANs than BA networks in the early stage of SI process, indicating that the large clustering coefficient may slower the spreading velocity especially in the outbreaks.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-199752