Jove
Visualize
Contact Us
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

Related Experiment Videos

Scale-free network growth by ranking.

Santo Fortunato1, Alessandro Flammini, Filippo Menczer

  • 1School of Informatics, Indiana University, Bloomington, Indiana 47406, USA.

Physical Review Letters
|June 29, 2006
PubMed
Summary
This summary is machine-generated.

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

Network clustering algorithms and preprocessing pipelines for robust cell type identification in single-cell RNA sequencing data.

Scientific reports·2026
Same author

Scale invariance and statistical significance in complex weighted networks.

Physical review. E·2026
Same author

Detectability threshold in weighted modular networks.

Physical review. E·2026
Same author

How malicious AI swarms can threaten democracy.

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

A perspective on friction interventions to curb the spread of misinformation.

Npj complexity·2025
Same author

Independently testing prosocial interventions: Methods and recommendations from 31 researchers.

Annals of the New York Academy of Sciences·2025

This study introduces a new network growth model based on node rank, not prestige value. This model explains scale-free networks even with incomplete rank information, offering insights into real-world network structures like the web graph.

Area of Science:

  • Network Science
  • Complex Systems
  • Statistical Physics

Background:

  • Current network growth models often rely on absolute node prestige (e.g., degree, fitness).
  • Network creators frequently lack precise prestige values, instead using node rankings.
  • Real-world networks often exhibit scale-free properties.

Purpose of the Study:

  • To propose a novel network growth criterion based on node rank rather than prestige.
  • To demonstrate how rank-based growth can generate scale-free networks.
  • To explain the prevalence and stability of scale-free degree distributions in empirical networks.

Main Methods:

  • Developing a network growth model where connection probability depends on a node's rank.
  • Analyzing the emergent degree distribution of the generated networks.

Related Experiment Videos

  • Investigating the impact of partial information on node ranks.
  • Applying the model to the World Wide Web (WWW) graph as a case study.

    • Main Results:

    • The proposed rank-based growth criterion results in scale-free degree distributions.
    • Scale-free properties emerge even with incomplete knowledge of node ranks.
    • The model provides a potential explanation for the ubiquity of scale-free networks.

    Conclusions:

    • Network growth driven by node rank is a viable mechanism for generating scale-free networks.
    • Rank-based growth offers a more realistic explanation for observed network structures compared to prestige-based models.
    • This framework enhances our understanding of complex network formation and evolution.