Jove
Visualize
Contact Us

Related Experiment Videos

Shortest paths and load scaling in scale-free trees.

Béla Bollobás1, Oliver Riordan

  • 1Department of Mathematical Sciences, University of Memphis, Memphis, Tennessee 38152, USA.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|April 20, 2004
PubMed
Summary

This study rigorously analyzes scale-free random trees, providing precise answers for node-to-node distance and node load distributions. Findings confirm previous heuristic predictions for these network properties.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

River landscapes and optimal channel networks.

Proceedings of the National Academy of Sciences of the United States of America·2018
Same author

Achlioptas processes are not always self-averaging.

Physical review. E, Statistical, nonlinear, and soft matter physics·2012
Same author

Explosive percolation is continuous.

Science (New York, N.Y.)·2011
Same author

Rigorous confidence intervals for critical probabilities.

Physical review. E, Statistical, nonlinear, and soft matter physics·2007
Same author

Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions.

Biological cybernetics·2005
Same author

The consequences of Zipf's law for syntax and symbolic reference.

Proceedings. Biological sciences·2005
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Area of Science:

  • Network science
  • Statistical physics
  • Graph theory

Background:

  • The Barabási-Albert (BA) model describes scale-free networks.
  • Random trees are a fundamental network structure.
  • Previous heuristic analyses provided approximate answers for tree properties.

Purpose of the Study:

  • To rigorously analyze node-to-node distances in scale-free random trees.
  • To precisely determine the distribution of node loads in these trees.
  • To validate and refine previous heuristic findings.

Main Methods:

  • Rigorous mathematical analysis of scale-free random trees.
  • Leveraging prior research on scale-free random graphs.
  • Asymptotic analysis and convergence proofs.

Related Experiment Videos

Main Results:

  • The node load distribution converges to a specific integer distribution, confirming a power law with exponent -2.
  • The distribution of node-to-node distances exhibits asymptotic normality.
  • A precise large deviation law for distances was derived.

Conclusions:

  • The study provides mathematically proven, precise results for scale-free random tree properties.
  • Heuristic mean-field approximations offer valuable insights for this model.
  • Findings enhance understanding of network structure and dynamics.