Large deviation principles for empirical measures of colored random graphs (Q614113): Difference between revisions

A random graph on n vertices has vertex colors chosen independently according to a common color distribution on a finite color set. Conditional on the vertex colors, edges are independently attached to the unordered vertex pairs with connection probability depending on n and the connected vertex colors. Empirical counting measures are considered for the number of vertices of each color, the number of edges between each pair of colors, and the number of vertices of each color with specified numbers of neighbors of each color. Large deviation principles are given for these measures, and their rate functions are expressed in terms of relative entropies. As a special case, a large deviation principle is stated for the degree distribution of a Bernoulli graph with expected degree converging to a constant.