For any finite colored graph we define the empirical neighborhood measure, which counts the number of vertices of a given color connected to a given number of vertices of each color, and the empirical pair measure, which counts the number of edges connecting each pair of colors. For a class of models of sparse colored random graphs, we prove large deviation principles for these empirical measures in the weak topology. The rate functions governing our large deviation principles can be expressed explicitly in terms of relative entropies. We derive a large deviation principle for the degree distribution of Erdős–Rényi graphs near criticality.
Publié le : 2010-12-15
Classification:
Random graph,
Erdős–Rényi graph,
random randomly colored graph,
typed graph,
spins,
joint large deviation principle,
empirical pair measure,
empirical measure,
degree distribution,
entropy,
relative entropy,
Ising model on a random graph,
partition function,
60F10,
05C80
@article{1287494552,
author = {Doku-Amponsah, Kwabena and M\"orters, Peter},
title = {Large deviation principles for empirical measures of colored random graphs},
journal = {Ann. Appl. Probab.},
volume = {20},
number = {1},
year = {2010},
pages = { 1989-2021},
language = {en},
url = {http://dml.mathdoc.fr/item/1287494552}
}
Doku-Amponsah, Kwabena; Mörters, Peter. Large deviation principles for empirical measures of colored random graphs. Ann. Appl. Probab., Tome 20 (2010) no. 1, pp. 1989-2021. http://gdmltest.u-ga.fr/item/1287494552/