Large deviation principles for empirical measures of colored random graphs

DOI10.1214/09-AAP647zbMath1213.60054arXivmath/0607545OpenAlexW3104521118MaRDI QIDQ614113

Kwabena Doku-Amponsah, Peter Mörters

Publication date: 27 December 2010

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0607545

zbMATH Keywords

relative entropyconvergence ratelarge deviation principledegree distributioncolor distributionRandom graphvertex color

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Large deviations (60F10)

Related Items (6)

Joint large deviation principle for some empirical measures of the d-regular random graphs ⋮ Large deviations for empirical measures of generalized random graphs ⋮ Scale-free graphs with many edges ⋮ Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics ⋮ Large deviations of empirical neighborhood distribution in sparse random graphs ⋮ Limit laws for the number of triangles in the generalized random graphs with random node weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large deviations in randomly coloured random graphs
• Some large deviation results for sparse random graphs
• Large deviations for mixtures
• Large deviations of \(U\)-empirical measures in strong topologies and applications
• Bins and balls: Large deviations of the empirical occupancy process
• Large deviations of Markov chains indexed by random trees
• Critical behavior in inhomogeneous random graphs
• Asymptotic equipartition properties for simple hierarchical and networked structures
• The phase transition in inhomogeneous random graphs
• Large deviations

This page was built for publication: Large deviation principles for empirical measures of colored random graphs