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

Pseudofractal scale-free web.

S N Dorogovtsev1, A V Goltsev, J F F Mendes

  • 1Departamento de Física and Centro de Física do Porto, Faculdade de Ciências, Universidade do Porto, Rua do Campo Alegre 687, 4169-007 Porto, Portugal. sdorogov@fc.up.pt

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|August 22, 2002
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

Early warning signals for percolation transitions in networks.

Physical review. E·2026
Same author

Localization of nonbacktracking centrality on dense subgraphs of sparse networks.

Physical review. E·2023
Same author

Sync and Swarm: Solvable Model of Nonidentical Swarmalators.

Physical review letters·2022
Same author

Hidden transition in multiplex networks.

Scientific reports·2022
Same author

Approximating nonbacktracking centrality and localization phenomena in large networks.

Physical review. E·2021
Same author

Impact of field heterogeneity on the dynamics of the forced Kuramoto model.

Physical review. E·2021

Simple deterministic graphs accurately model scale-free random networks. This compact structure exhibits properties similar to complex growing networks, with precisely calculated characteristics like shortest-path distributions.

Area of Science:

  • Network Science
  • Graph Theory
  • Statistical Physics

Background:

  • Scale-free networks are crucial in various complex systems.
  • Understanding their properties is essential for modeling real-world networks.
  • Existing models often struggle to capture the precise characteristics of these networks.

Purpose of the Study:

  • To investigate the applicability of simple deterministic graphs in modeling scale-free random networks.
  • To analyze the degree distribution and other key properties of a proposed deterministic graph model.
  • To compare the model's characteristics with those of growing random scale-free networks.

Main Methods:

  • Constructing a deterministic graph with a discrete power-law degree distribution.
  • Calculating exact and numerical properties of the graph, including shortest-path length distribution.

Related Experiment Videos

  • Analyzing the eigenvalue spectrum of the graph's adjacency matrix.

    • Main Results:

    • The deterministic graph accurately models scale-free networks, particularly those with a degree exponent (gamma) between 2 and 3.
    • The graph exhibits a power-law degree distribution with gamma = 1 + ln(3)/ln(2).
    • The shortest-path length distribution approximates a Gaussian for large networks, and the eigenvalue spectrum shows a power-law tail.

    Conclusions:

    • Simple deterministic graphs provide an excellent and computationally tractable model for scale-free random networks.
    • The model successfully reproduces key network characteristics, offering insights into network structure and dynamics.
    • This approach facilitates precise analysis of network properties, including spectral and path-length distributions.