Routing in Poisson small-world networks

Simple item page
dc.creatorDraief, M.
dc.creatorGanesh, A.
dc.date2005-08-22
dc.date.accessioned2026-07-07T05:22:34Z
dc.date.available2026-07-07T05:22:34Z
dc.descriptionIn recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power of the distance between them. Kleinberg studied the efficiency of greedy routing depending on the value of the power. The results were extended to a continuum model by Franceschetti and Meester. In our work, we extend the result to more realistic models constructed from a Poisson point process, wherein each point is connected to all its neighbours within some fixed radius, as well as possessing random shortcuts to more distant nodes as described above.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0508410
dc.identifierhttp://arxiv.org/abs/math/0508410
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76112
dc.subjectProbability
dc.subject90B15
dc.titleRouting in Poisson small-world networks
dc.typetext

Files

Collections

arXiv