Translator Disclaimer
2009 Moderate Deviations in a Random Graph and for the Spectrum of Bernoulli Random Matrices
Hanna Döring, Peter Eichelsbacher
Author Affiliations +
Electron. J. Probab. 14(none): 2636-2656 (2009). DOI: 10.1214/EJP.v14-723

Abstract

We prove the moderate deviation principle for subgraph count statistics of Erdös-Rényi random graphs. This is equivalent in showing the moderate deviation principle for the trace of a power of a Bernoulli random matrix. It is done via an estimation of the log-Laplace transform and the Gärtner-Ellis theorem. We obtain upper bounds on the upper tail probabilities of the number of occurrences of small subgraphs. The method of proof is used to show supplemental moderate deviation principles for a class of symmetric statistics, including non-degenerate U-statistics with independent or Markovian entries.

Citation

Download Citation

Hanna Döring. Peter Eichelsbacher. "Moderate Deviations in a Random Graph and for the Spectrum of Bernoulli Random Matrices." Electron. J. Probab. 14 2636 - 2656, 2009. https://doi.org/10.1214/EJP.v14-723

Information

Accepted: 12 December 2009; Published: 2009
First available in Project Euclid: 1 June 2016

zbMATH: 1193.60032
MathSciNet: MR2570014
Digital Object Identifier: 10.1214/EJP.v14-723

Subjects:
Primary: 60F10
Secondary: 05C80, 15A52, 60F05, 62G20

JOURNAL ARTICLE
21 PAGES


SHARE
Vol.14 • 2009
Back to Top