arXiv · cond-mat/0301504
Geographical Embedding of Scale-Free Networks
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.
Explore related subjects
Keep this discovery
Daniel ben-Avraham, Alejandro F. Rozenfeld, Reuven Cohen, Shlomo Havlin. 2003-01-26. Geographical Embedding of Scale-Free Networks. https://doi.org/10.1016/j.physa.2003.08.036
Cite the original work for its findings. Save a collection to share your selection of sources.