# Exponential Approximation, Method of types for Empirical Neighbourhood Measures of Random graphs by Random Allocation

Source: [Exponential Approximation, Method of types for Empirical Neighbourhood Measures of Random graphs by Random Allocation](<https://www.sota2.com/research/paper/68fa50f71e209131ce96fb03>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T11:08:29.811Z

Authors: K. Doku-Amponsah

Published: 2012-12-18T09:32:26.000Z

## Abstract

In this article we find exponential good approximation of the empirical neigbourhood distribution of symbolled random graphs conditioned to a given empirical symbol distribution and empirical pair distribution. Using this approximation we shorten or simplify the proof of (Doku-Amponsah and Morters 2010, Theorem~2.5); the large deviation principle (LDP) for empirical neigbourhood distribution of symbolled random graphs. We also show that the LDP for the empirical degree measure of the classical Erd\\H{o}s-R\\'{e}nyi graph is a special case of (Doku-Amponsah and Moerters, 2010, Theorem~2.5). From the LDP for the empirical degree measure, we derive an LDP for the the proportion of isolated vertices in the classical Erd\\H{o}s-R\\'{e}nyi graph.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1212.4281>)

[PDF](<https://arxiv.org/pdf/1212.4281.pdf>)
