Geographical embedding of scale-free networks

Daniel Ben-Avraham; Alejandro F. Rozenfeld; Reuven Cohen; Shlomo Havlin

doi:10.1016/j.physa.2003.08.036

Geographical embedding of scale-free networks

Daniel Ben-Avraham, Alejandro F. Rozenfeld, Reuven Cohen, Shlomo Havlin

Research output: Contribution to journal › Conference article › peer-review

39 Scopus citations

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.

Original language	English
Pages (from-to)	107-116
Number of pages	10
Journal	Physica A: Statistical Mechanics and its Applications
Volume	330
Issue number	1-2
DOIs	https://doi.org/10.1016/j.physa.2003.08.036
State	Published - 1 Dec 2003
Event	Randomes and Complexity - Eilat, Israel Duration: 5 Jan 2003 → 9 Jan 2003

Bibliographical note

Funding Information:
We are grateful to NSF grant PHY-0140094 (DbA) for partial support of this research.

Funding

We are grateful to NSF grant PHY-0140094 (DbA) for partial support of this research.

Funders	Funder number
DbA
National Science Foundation	PHY-0140094
Directorate for Mathematical and Physical Sciences	0140094

Keywords

Embedding
Internet
Lattice
Networks
Scale-free

Access to Document

10.1016/j.physa.2003.08.036

Cite this

@article{652d184b10b242d2b86c07d6d7e86609,

title = "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.",

keywords = "Embedding, Internet, Lattice, Networks, Scale-free",

author = "Daniel Ben-Avraham and Rozenfeld, {Alejandro F.} and Reuven Cohen and Shlomo Havlin",

note = "Funding Information: We are grateful to NSF grant PHY-0140094 (DbA) for partial support of this research. ; Randomes and Complexity ; Conference date: 05-01-2003 Through 09-01-2003",

year = "2003",

month = dec,

day = "1",

doi = "10.1016/j.physa.2003.08.036",

language = "אנגלית",

volume = "330",

pages = "107--116",

journal = "Physica A: Statistical Mechanics and its Applications",

issn = "0378-4371",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Geographical embedding of scale-free networks

AU - Ben-Avraham, Daniel

AU - Rozenfeld, Alejandro F.

AU - Cohen, Reuven

AU - Havlin, Shlomo

N1 - Funding Information: We are grateful to NSF grant PHY-0140094 (DbA) for partial support of this research.

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

KW - Embedding

KW - Internet

KW - Lattice

KW - Networks

KW - Scale-free

UR - http://www.scopus.com/inward/record.url?scp=0345412053&partnerID=8YFLogxK

U2 - 10.1016/j.physa.2003.08.036

DO - 10.1016/j.physa.2003.08.036

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0345412053

SN - 0378-4371

VL - 330

SP - 107

EP - 116

JO - Physica A: Statistical Mechanics and its Applications

JF - Physica A: Statistical Mechanics and its Applications

IS - 1-2

T2 - Randomes and Complexity

Y2 - 5 January 2003 through 9 January 2003

ER -

Geographical embedding of scale-free networks

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this