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 networks on lattices.

Alejandro F Rozenfeld1, Reuven Cohen, Daniel Ben-Avraham

  • 1Minerva Center and Department of Physics, Bar-Ilan University, Ramat-Gan 52900, Israel.

Physical Review Letters
|November 22, 2002
PubMed
Summary

We present a method to embed scale-free networks into Euclidean lattices, minimizing link length. This embedding is successful for networks with lambda>2, revealing compact clusters and unique shortest path dimensions.

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

Design of robust networks via reinforcement learning prompts the emergence of multi-backbones.

Nature communications·2026
Same author

Slower searching yields higher efficiency: A case study of taxi drivers.

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

Evaluating in-vivo spontaneous firing rate in the brain based on neuronal noise modeling.

Communications biology·2025
Same author

Lessons from complex systems science for AI governance.

Patterns (New York, N.Y.)·2025
Same author

The random cascading origin of abrupt transitions in interdependent systems.

Nature communications·2025
Same author

The critical role of persistent disruption in advancing science.

Nature computational science·2025

Area of Science:

  • Network science
  • Statistical physics
  • Geometric embedding

Background:

  • Scale-free networks exhibit power-law degree distributions (Pk ~ k^-lambda).
  • Embedding complex networks into geometric spaces is crucial for understanding their structure and function.
  • Geographical constraints and link length minimization are important factors in network design.

Purpose of the Study:

  • To develop a method for embedding scale-free networks into Euclidean lattices.
  • To account for geographical properties and minimize total link length.
  • To analyze the structural properties of the embedded networks, including cluster compactness and shortest path dimensions.

Main Methods:

  • Developing an embedding algorithm driven by the minimization of total link length.
  • Utilizing a natural constraint for embedding scale-free networks into regular Euclidean lattices.
  • Analyzing the fractal dimension of clusters and the shortest path dimension between sites.

Main Results:

  • Successful embedding of scale-free networks (lambda>2) into Euclidean lattices is demonstrated.
  • The embedding distance (xi) can be arbitrarily large by adjusting an external parameter.
  • Clusters of chemical shells exhibit compact fractal dimension (df=d), while shortest path dimension is dmin=(lambda-2)/(lambda-1-1/d).

Conclusions:

  • The proposed method provides a successful framework for embedding scale-free networks into geometric spaces.
  • The embedded networks exhibit distinct structural properties, differing from other known fractal and disordered lattices.
  • This work offers insights into the relationship between network topology and geometric embedding, with implications for network design and analysis.

Related Experiment Videos