Some large deviation results for near intermediate random geometric graphs
Probability
2014-06-13 v2
Abstract
We find large deviation principles for the degree distribution and the proportion of isolated vertices for the near intermediate random geometric graph models on n vertices placed uniformly in [0, 1]^d, for d in N. In the course of the proof of these large deviation results we find joint large deviation principle for the empirical locality measure of the coloured random geometric graphs,(Canning & Penman, 2003).
Cite
@article{arxiv.1312.6326,
title = {Some large deviation results for near intermediate random geometric graphs},
author = {Kwabena Doku-Amponsah},
journal= {arXiv preprint arXiv:1312.6326},
year = {2014}
}
Comments
7 pages