Some large deviation results for near intermediate random geometric graphs

2013/12/21 by Kwabena Doku-Amponsah, Doku-Amponsah, Kwabena
Mathematics · #05C80 #60F10 #FOS: Mathematics #Limits and Structures in Graph Theory #Probability (math.PR) #Random Matrices and Applications #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1312.6326

openalex publication_date 2013/12/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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).

Related

• An introduction to large deviations for random graphs
• Local Large deviations for empirical locality measure of typed Random Graph Models
• Large deviation for uniform graphs with given degrees
• Large Deviation Principles for Block and Step Graphon Random Graph Models
• Marked random graphs with given degree sequence: large deviations on the local topology