Publication:

Small worlds

Date

Date

Date
2001
Journal Article
Published version
Simple data Full metadata Statistics
cris.lastimport.scopus2025-07-07T03:40:06Z
cris.lastimport.wos2025-08-03T01:31:28Z
dc.contributor.institutionUniversity of Zurich
dc.date.accessioned2010-03-04T14:32:05Z
dc.date.available2010-03-04T14:32:05Z
dc.date.issued2001
dc.description.abstract

Small world models are networks consisting of many local links and fewer long range shortcuts. In this paper, we consider some particular instances, and rigorously investigate the distribution of their inter-point network distances. Our results are framed in terms of approximations, whose accuracy increases with the size of the network. We also give some insight into how the reduction in typical inter-point distances occasioned by the presence of shortcuts is related to the dimension of the underlying space. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19, 54-74, 2001

dc.identifier.doi10.1002/rsa.1018
dc.identifier.issn1042-9832
dc.identifier.scopus2-s2.0-0035613369
dc.identifier.urihttps://www.zora.uzh.ch/handle/20.500.14742/44349
dc.identifier.wos000170256100003
dc.language.isoeng
dc.subjectSoftware
dc.subjectApplied Mathematics
dc.subjectGeneral Mathematics
dc.subjectComputer Graphics and Computer-Aided Design
dc.subject.ddc510 Mathematics
dc.title

Small worlds

dc.typearticle
dcterms.accessRightsinfo:eu-repo/semantics/openAccess
dcterms.bibliographicCitation.journaltitleRandom Structures & Algorithms
dcterms.bibliographicCitation.number1
dcterms.bibliographicCitation.originalpublishernameWiley-Blackwell
dcterms.bibliographicCitation.pageend74
dcterms.bibliographicCitation.pagestart54
dcterms.bibliographicCitation.volume19
dspace.entity.typePublicationen
uzh.contributor.affiliationUniversity of Zurich, University of Oxford
uzh.contributor.affiliationKing's College Cambridge
uzh.contributor.authorBarbour, A D
uzh.contributor.authorReinert, G
uzh.contributor.correspondenceYes
uzh.contributor.correspondenceNo
uzh.document.availabilitypostprint
uzh.eprint.datestamp2010-03-04 14:32:05
uzh.eprint.lastmod2025-08-03 01:37:40
uzh.eprint.statusChange2009-10-13 16:25:57
uzh.harvester.ethYes
uzh.harvester.nbNo
uzh.identifier.doi10.5167/uzh-21993
uzh.oastatus.unpaywallclosed
uzh.oastatus.zoraGreen
uzh.publication.citationBarbour, A D; Reinert, G (2001). Small worlds. Random Structures & Algorithms, 19(1):54-74.
uzh.publication.originalworkoriginal
uzh.publication.publishedStatusfinal
uzh.relatedUrl.urlhttps://www.zora.uzh.ch/21769/
uzh.scopus.impact31
uzh.scopus.subjectsSoftware
uzh.scopus.subjectsGeneral Mathematics
uzh.scopus.subjectsComputer Graphics and Computer-Aided Design
uzh.scopus.subjectsApplied Mathematics
uzh.workflow.doajuzh.workflow.doaj.false
uzh.workflow.eprintid21993
uzh.workflow.fulltextStatuspublic
uzh.workflow.revisions113
uzh.workflow.rightsCheckkeininfo
uzh.workflow.statusarchive
uzh.wos.impact26
Files

Original bundle

Name:
ZORA21993V.pdf
Size:
255.37 KB
Format:
Adobe Portable Document Format
ZORA21993V.pdfview fileDownload |Download255.37 KB
Publication available in collections:
Publications of Institute of Mathematics