Moderate deviation in colored random graphs

MaRDI QIDQ3537008zbMATH OpenFDO

Authors Hui Jiang

Publication date 24 November 2008

zbMATH Keywords

moderate deviationrandom graphsStirling formulaTaylor series expansionlaw of iterated logarithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Moderate deviations in a random graph and for the spectrum of Bernoulli random matrices
• Large deviations in randomly coloured random graphs
• Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
• Large deviation principles for empirical measures of colored random graphs
• Stochastic processes in random graphs

Cited in

(4)

• Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
• Large deviations in randomly coloured random graphs
• Moderate deviations in cycle count
• Moderate deviations in a random graph and for the spectrum of Bernoulli random matrices

This page was built for publication: Moderate deviation in colored random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537008)