The rigorous solution for the average distance of a Sierpinski network

Details The rigorous solution for the average distance of a Sierpinski network The rigorous solution for the average distance of a Sierpinski network

2008-10-29

arxiv.org/abs/0810.5172v3

J. Stat. Mech. (2009) P02034

Physics

Condensed Matter

Statistical Mechanics

Definitive version (9 pages, 6 figures) published in J. Stat. Mech

Scientific paper

10.1088/1742-5468/2009/02/P02034

The closed-form solution for the average distance of a deterministic network--Sierpinski network--is found. This important quantity is calculated exactly with the help of recursion relations, which are based on the self-similar network structure and enable one to derive the precise formula analytically. The obtained rigorous solution confirms our previous numerical result, which shows that the average distance grows logarithmically with the number of network nodes. The result is at variance with that derived from random networks.

Affiliated with

Also associated with

No associations

Rating

The rigorous solution for the average distance of a Sierpinski 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 The rigorous solution for the average distance of a Sierpinski network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The rigorous solution for the average distance of a Sierpinski network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-71428