Generating hierarchial scale free graphs from fractals

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 figures

Scientific paper

Motivated by the hierarchial network model of E. Ravasz, A.-L. Barabasi, and T. Vicsek, we introduce deterministic scale-free networks derived from a graph directed self-similar fractal $\Lambda $. With rigorous mathematical results we verify that our model captures some of the most important features of many real networks: the scale free and the high clustering properties. We also prove that the diameter is the logarithm of the size of the system. Using our (deterministic) fractal $\Lambda $ we generate random graph sequence sharing similar properties.

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

Generating hierarchial scale free graphs from fractals 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 Generating hierarchial scale free graphs from fractals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generating hierarchial scale free graphs from fractals will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-417710

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