Biggins, J. D.; Penman, D. B. Large deviations in randomly coloured random graphs. (English) Zbl 1185.05125 Electron. Commun. Probab. 14, 290-301 (2009). Summary: Models of random graphs are considered where the presence or absence of an edge depends on the random types (colours) of its vertices, so that whether or not edges are present can be dependent. The principal objective is to study large deviations in the number of edges. These graphs provide a natural example with two different non-degenerate large deviation regimes, one arising from large deviations in the colourings followed by typical edge placement and the other from large deviation in edge placement. A secondary objective is to illustrate the use of a general result on large deviations for mixtures. Cited in 2 Documents MSC: 05C80 Random graphs (graph-theoretic aspects) 05C15 Coloring of graphs and hypergraphs 60F10 Large deviations Keywords:large deviations; mixture; rate function; random graphs PDFBibTeX XMLCite \textit{J. D. Biggins} and \textit{D. B. Penman}, Electron. Commun. Probab. 14, 290--301 (2009; Zbl 1185.05125) Full Text: DOI EuDML EMIS