Thumbnail
Access Restriction
Open

Author Sun, Jie ♦ ben-Avraham, Daniel
Source arXiv.org
Content type Text
File Format PDF
Date of Submission 2010-01-28
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Natural sciences & mathematics ♦ Physics
Subject Keyword Condensed Matter - Statistical Mechanics ♦ Computer Science - Networking and Internet Architecture ♦ Physics - Physics and Society ♦ cs ♦ physics:cond-mat ♦ physics:physics
Abstract We introduce a measure of {\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors. Constraints of this type are common in everyday life applications. Greedy connectivity accounts also for imperfect transmission across established links and is larger the higher the proportion of nodes that can be reached from other nodes with a high probability. Greedy connectivity can be used as a criterion for optimal network design.
Educational Use Research
Learning Resource Type Article


Open content in new tab

   Open content in new tab