Geographical embedding of scale-free networks

DOI10.1016/J.PHYSA.2003.08.036zbMATH Open1027.05026arXivcond-mat/0301504OpenAlexW2120698442MaRDI QIDQ1412892FDOQ1412892

Authors: Alejandro F. Rozenfeld, Reuven Cohen, Daniel ben-Avraham, Shlomo Havlin 

Publication date: 30 November 2003

Published in: Physica A (Search for Journal in Brave)

Abstract: A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of scale-free networks embedded by the suggested algorithm are studied both analytically and through simulations. Our findings indicate dramatic changes in the embedded networks, in comparison to their off-lattice counterparts, and call into question the applicability of off-lattice scale-free models to realistic, everyday-life networks.

Full work available at URL: https://arxiv.org/abs/cond-mat/0301504

Recommendations

• Efficient embedding of scale-free graphs in the hyperbolic plane
• GEOGRAPHICAL EFFECTS ON EPIDEMIC SPREADING IN SCALE-FREE NETWORKS
• Directed and non-directed scale-free networks
• SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS
• Emergence of Scaling in Random Networks

zbMATH Keywords

graph embeddingEuclidean spacenode connection

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Diffusion and reactions in fractals and disordered systems
• A critical point for random graphs with a given degree sequence
• Collective dynamics of `small-world' networks
• Title not available (Why is that?)
• Renormalization group analysis of the small-world network model
• On the strength of connectedness of a random graph
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• The role of spatial interaction in social networks
• Universality for critical heavy-tailed network models: metric structure of maximal components
• THE ROLE OF GEOGRAPHY AND TRAFFIC IN THE STRUCTURE OF COMPLEX NETWORKS
• SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS
• A generalised model for asymptotically-scale-free geographical networks
• Epidemics, disorder, and percolation
• The Kuramoto model in complex networks
• Efficient embedding of scale-free graphs in the hyperbolic plane
• Scaling properties of first return time on weighted transfractals \((1, 3)\)-flowers
• Unimodular lattice triangulations as small-world and scale-free random graphs

This page was built for publication: Geographical embedding of scale-free networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1412892)