Vertex degree of random geometric graph on exponentially distributed points

Bhupendra Gupta

Statistics & Probability Letters, 2009, vol. 79, issue 19, 2020-2027

Abstract: In this article, we consider exponential random geometric graph, in d-dimensional space (d>=2). The main results are almost-sure asymptotic rates of convergence/divergence for the maximum and minimum vertex degrees of graph, when edge distance varies with the number of vertices.

Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(09)00235-1
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:79:y:2009:i:19:p:2020-2027

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().