Large deviation result for the empirical locality measure of typed random geometric graphs

No Thumbnail Available

Date

2015

Journal Title

Journal ISSN

Volume Title

Publisher

International journal of Statistics and Probability

Abstract

In this article for a finite typed random geometric graph we define the empirical locality distribution, which records the number of nodes of a given type linked to a given number of nodes of each type. We find large deviation principle (LDP) for the empirical locality measure given the empirical pair measure and the empirical type measure of the typed random geometric graphs. From this LDP, we derive large deviation principles for the degree measure and the proportion of detached nodes in the classical Erd˝os-R´enyi graph defined on [0, 1]d. This graphs have been suggested by (Canning and Penman, 2003) as a possible extension to the randomly typed random graphs.

Description

Keywords

typed random geometric graph, empirical locality measure, empirical degree measure, detached nodes

Citation

Endorsement

Review

Supplemented By

Referenced By