Correlations in random Apollonian network

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, 3 figures. Accepted for publication in Physica A

Scientific paper

10.1016/j.physa.2007.02.058

In this paper, by both simulations and theoretical predictions we study two and three node (or degree) correlations in random Apollonian network (RAN), which have small-world and scale-free topologies. Using the rate equation approach under the assumption of continuous degree, we first give the analytical solution for two node correlations, expressed by average nearest-neighbor degree (ANND). Then, we revisit the degree distribution of RAN using rate equation method and get the exact connection distribution, based on which we derive a more accurate result for mean clustering coefficient as an average quantity of three degree correlations than the one previously reported. Analytical results reveal that ANND has no correlations with respect to degree, while clustering coefficient is dependent on degree, showing a power-law behavior as $C(k)\sim k^{-1}$. The obtained expressions are successfully contrasted with extensive numerical simulations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-690958

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.