Moderate deviations in a random graph and for the spectrum of Bernoulli random matricesn

Electronic Journal of Probability

Volumn 14, Issue , 2009, Pages 2636-2656

  Döring, Hanna ^a   Eichelsbacher, Peter ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Concentration inequalities; Markov chains; Moderate deviations; Random graphs; Random matrices; U statistics

Indexed keywords

EID: 77956101526     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v14-723     Document Type: Article

References (22)

1. G. Ben Arous and A. Guionnet. Large deviations for Wigner's law and Voiculescu's noncommutative entropy. Probab. Theory Related Fields, 108(4):517-542, 1997.
2. R. C. Bradley. Basic properties of strong mixing conditions. A survey and some open questions. Probab. Surv., 2:107-144 (electronic), 2005. Update of, and a supplement to, the 1986 original.
3. O. Catoni. Laplace transform estimates and deviation inequalities. Ann. Inst. H. Poincaré, Probabilités et Statistiques, 39(1):1-26, 2003.
4. S. Chatterjee and ES. Dey. Applications of Stein's method for concentration inequalities. preprint, see arXiv:0906.1034v1, 2009.
5. A. Dembo, A. Guionnet, and O. Zeitouni. Moderate deviations for the spectral measure of certain random matrices. Ann. Inst. H. Poincaré Probab. Statist., 39(6):1013-1042, 2003.
6. B. Delyon, A. Juditsky, and R. Liptser. Moderate deviation principle for ergodic Markov chain. Lipschitz summands. In From stochastic calculus to mathematical finance, pages 189-209. Springer, Berlin, 2006.
7. A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications, volume 38 of Applications of Mathematics. Springer-Verlag, New York, second edition, 1998.
8. E Eichelsbacher. Moderate and large deviations for U-processes. Stochastic Process. Appl., 74(2):273-296, 1998.
9. E. Eichelsbacher. Moderate deviations for functional U-processes. Ann. Inst. H. Poincaré Probab. Statist., 37(2):245-273, 2001.
10. E. Eichelsbacher and U. Schmock. Rank-dependent moderate deviations of u-empirical measures in strong topologies. Probab. Theory Relat. Fields, 126:61-90, 2003.
11. S. Janson. Eoisson approximation for large deviations. Random Structures Algorithms, 1(2):221-229, 1990.
12. S. Janson, T. Luczak, and T. Rucinski. An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. In Random graphs '87 (Poznan, 1987), pages 73-87. Wiley, Chichester, 1990.
13. S. Janson, T. Luczak, and A. Rucinski. Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.
14. S. Janson, K. Oleszkiewicz, and A. Rucinski. Upper tails for subgraph counts in random graphs. Israel J. Math., 142:61-92, 2004.
15. S. Janson and A. Rucinski. The infamous upper tail. Random Structures Algorithms, 20(3):317-342, 2002. Probabilistic methods in combinatorial optimization.
16. S. Janson and A. Rucinski. The deletion method for upper tail estimates. Combinatorica, 24(4):615-640, 2004.
17. J. H. Kim and V. H. Vu. Divide and conquer martingales and the number of triangles in a random graph. Random Structures Algorithms, 24(2):166-174, 2004.
18. A. J. Lee. U-statistics Theory and Practice, volume 110 of Statistics: Textbooks and Monographs. M. Dekker, New York, 1990.
19. K. Nowicki and J.C. Wierman. Subgraph counts in random graphs using incomplete U-statistics methods. In Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), volume 72, pages 299-310, 1988.
20. A. Rucinski. When are small subgraphs of a random graph normally distributed? Probab. Theory Related Fields, 78(1):1-10, 1988.
21. V H. Vu. A large deviation result on the number of small subgraphs of a random graph. Combin. Probab. Comput., 10(1):79-94, 2001.
22. L. M. Wu. Moderate deviations of dependent random variables related to CLT. Ann. Probab., 23(1):420-445, 1995.