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

Spectra of complex networks.

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
|December 20, 2003
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

We present a method to analyze complex network spectra, linking eigenvalue density tails to vertex degree distributions. This approach aids in understanding real-world network properties.

Area of Science:

  • Complex Networks Analysis
  • Spectral Graph Theory
  • Statistical Physics

Background:

  • Understanding the spectral properties of complex networks is crucial for characterizing their structure and function.
  • Existing methods often struggle with networks exhibiting correlations or non-trivial degree distributions.

Purpose of the Study:

  • To develop a general analytical approach for describing the spectra of complex networks.
  • To establish a relationship between the eigenvalue density tail and the vertex degree distribution.
  • To provide a method for calculating network spectra analytically.

Main Methods:

  • Derivation of exact equations for spectra of networks with uncorrelated vertices and treelike structures.
  • Generalization of these equations to networks with correlations between neighboring vertices.

Related Experiment Videos

  • Relating the tail of the eigenvalue density (rho(lambda)) to the vertex degree distribution (P(k)).

    • Main Results:

    • Exact equations derived for uncorrelated, treelike networks.
    • Generalization to correlated networks.
    • Established relationship: rho(lambda) approximately lambda^(1-2*gamma) for P(k) approximately k^(-gamma).
    • A simple approximation for analytical spectral calculations.

    Conclusions:

    • The spectral properties of locally treelike random graphs can serve as a baseline for analyzing real-world networks.
    • The method provides insights into the role of low-degree vertices in network spectra.
    • The findings are applicable to diverse complex networks, including the Internet.