Discrete small world networks

Simple item page
dc.creatorBarbour, A. D.
dc.creatorReinert, G.
dc.date2003-04-01
dc.date.accessioned2026-07-07T02:50:33Z
dc.date.available2026-07-07T02:50:33Z
dc.descriptionSmall world models are networks consisting of many local links and fewer long range 'shortcuts', used to model networks with a high degree of local clustering but relatively small diameter. Here, we concern ourselves with the distribution of typical inter-point network distances. We establish approximations to the distribution of the graph distance in a discrete ring network with extra random links, and compare the results to those for simpler models, in which the extra links have zero length and the ring is continuous.
dc.description48 pages
dc.identifierhttps://arxiv.org/abs/cond-mat/0304020
dc.identifierhttp://arxiv.org/abs/cond-mat/0304020
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/21143
dc.subjectCondensed Matter
dc.titleDiscrete small world networks
dc.typetext

Files

Collections

arXiv