Geographical Embedding of Scale-Free Networks

Simple item page
dc.creatorben-Avraham, Daniel
dc.creatorRozenfeld, Alejandro F.
dc.creatorCohen, Reuven
dc.creatorHavlin, Shlomo
dc.date2003-01-26
dc.date.accessioned2026-07-07T02:49:21Z
dc.date.available2026-07-07T02:49:21Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/cond-mat/0301504
dc.identifierhttp://arxiv.org/abs/cond-mat/0301504
dc.identifierPhysica A 330, 107 (2003)
dc.identifierdoi:10.1016/j.physa.2003.08.036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/20764
dc.subjectCondensed Matter
dc.titleGeographical Embedding of Scale-Free Networks
dc.typetext

Files

Collections

arXiv