Limit theory for the random on-line nearest-neighbor graph

M D Penrose; A R Wade

doi:10.1002/rsa.20185

Limit theory for the random on-line nearest-neighbor graph

M D Penrose
, A R Wade

Department of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

14 Citations (SciVal)

Original language	English
Pages (from-to)	125-156
Number of pages	32
Journal	Random Structures and Algorithms
Volume	32
Issue number	2
DOIs	https://doi.org/10.1002/rsa.20185
Publication status	Published - 2008

Bibliographical note

ID number: ISI:000253204000001

Access to Document

10.1002/rsa.20185

Cite this

@article{61dad5e2d0ea48d3ae68265cc3f60da6,

title = "Limit theory for the random on-line nearest-neighbor graph",

author = "Penrose, \{M D\} and Wade, \{A R\}",

note = "ID number: ISI:000253204000001",

year = "2008",

doi = "10.1002/rsa.20185",

language = "English",

volume = "32",

pages = "125--156",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Inc.",

number = "2",

}

TY - JOUR

T1 - Limit theory for the random on-line nearest-neighbor graph

AU - Penrose, M D

AU - Wade, A R

N1 - ID number: ISI:000253204000001

PY - 2008

Y1 - 2008

UR - https://www.scopus.com/pages/publications/52349123319

UR - http://arxiv.org/abs/math/0603561

UR - http://dx.doi.org/10.1002/rsa.20185

U2 - 10.1002/rsa.20185

DO - 10.1002/rsa.20185

M3 - Article

SN - 1042-9832

VL - 32

SP - 125

EP - 156

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 2

ER -

Limit theory for the random on-line nearest-neighbor graph

Bibliographical note

Access to Document

Other files and links

Cite this