Applications of Stein's method for concentration inequalities

Annals of Probability

Volumn 38, Issue 6, 2010, Pages 2443-2485

  Chatterjee, Sourav ^a   Dey, Partha S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Concentration inequality; Curie Weiss model; Erdo double acute s R nyi random graph; Exponential random graph; Gibbs measures; Ising model; Large deviation; Stein's method

Indexed keywords

EID: 77957913417     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/10-AOP542     Document Type: Article

References (39)

1. BARTHE, F., CATTIAUX, P. and ROBERTO, C. (2005). Concentration for independent random variables with heavy tails. AMRX Appl. Math. Res. Express 2 39-60.
2. BARTHE, F., CATTIAUX, P. and ROBERTO, C. (2006). Interpolated inequalities between exponential and Gaussian, Orlicz hypercontractivity and isoperimetry. Rev. Mat. Iberoamericana 22 993-1067.
3. BHAMIDI, S., BRESLER, G. and SLY, A. (2008). Mixing time of exponential random graphs. In Proc. of the 49th Annual IEEE Symp. on FOCS 803-812. IEEE Computer Society, Washington, DC.
4. BOBKOV, S. G. (2007). Large deviations and isoperimetry over convex probability measures with heavy tails. Electron. J. Probab. 12 1072-1100 (electronic).
5. BOBKOV, S. G. and LEDOUX, M. (2000). From Brunn-Minkowski to Brascamp-Lieb and to logarithmic Sobolev inequalities. Geom. Funct. Anal. 10 1028-1052.
6. BOLLOBÁS, B. (2001). Random Graphs, 2nd ed. Cambridge Studies in Advanced Mathematics 73. Cambridge Univ. Press, Cambridge.
7. BOLTHAUSEN, E. (1987). Laplace approximations for sums of independent random vectors. II. Degenerate maxima and manifolds of maxima. Probab. Theory Related Fields 76 167-206.
8. BOLTHAUSEN, E., COMETS, F. and DEMBO, A. (2009). Large deviations for random matrices and random graphs. Unpublished manuscript.
9. BOUCHERON, S., LUGOSI, G. and MASSART, P. (2003). Concentration inequalities using the entropy method. Ann. Probab. 31 1583-1614.
10. CHATTERJEE, S. (2005). Concentration inequalities with exchangeable pairs. Ph.D. thesis, Stanford Univ. Available at arXiv:math/0507526.
11. CHATTERJEE, S. (2007). Stein's method for concentration inequalities. Probab. Theory Related Fields 138 305-321.
12. CHATTERJEE, S. (2007). Concentration of Haar measures, with an application to random matrices. J. Funct. Anal. 245 379-389.
13. CHATTERJEE, S. and SHAO, Q.-M. (2009). Stein's method of exchangeable pairs with application to the Curie-Weiss model. Preprint. Available at arXiv:0907.4450.
14. CHAZOTTES, J. R., COLLET, P., KÜLSKE, C. and REDIG, F. (2007). Concentration inequalities for random fields via coupling. Probab. Theory Related Fields 137 201-225.
15. DÖRING, H. and EICHELSBACHER, P. (2009). Moderate deviations in a random graph and for the spectrum of Bernoulli random matrices. Electron. J. Probab. 14 2636-2656.
16. EICHELSBACHER, P. and LOWE, M. (2009). Stein's method for dependent random variables occurring in statistical mechanics. Preprint. Available at arXiv:0908.1909.
17. ELLIS, R. S. and NEWMAN, C. M. (1978). The statistics of Curie-Weiss models. J. Stat. Phys. 19 149-161.
18. ELLIS, R. S. and NEWMAN, C. M. (1978). Limit theorems for sums of dependent random variables occurring in statistical mechanics. Z. Wahrsch. Verw. Gebiete 44 117-139.
19. ELLIS, R. S. (1985). Entropy, Large Deviations, and Statistical Mechanics. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 271. Springer, New York.
20. GENTIL, I., GUILLIN, A. and MICLO, L. (2005). Modified logarithmic Sobolev inequalities and transportation inequalities. Probab. Theory Related Fields 133 409-436.
21. GOZLAN, N. (2007). Characterization of Talagrand's like transportation-cost inequalities on the real line. J. Funct. Anal. 250 400-425.
22. GOZLAN, N. (2010). Poincare inequalities and dimension free concentration of measure. Ann. Inst. H. Poincaré Probab. Statist. To appear.
23. ISING, E. (1925). Beitrag zur theorie des ferromagnetismus. Zeitschrift für Physik A Hadrons and Nuclei 31 253-258.
24. JANSON, S., ŁUCZAK, T. and RUCINSKI, A. (2000). Random Graphs. Wiley, New York.
25. JANSON, S., OLESZKIEWICZ, K. and RUCIŃSKI, A. (2004). Upper tails for subgraph counts in random graphs. Israel J. Math. 142 61-92.
26. JANSON, S. and RUCIŃSKI, A. (2002). The infamous upper tail: Probabilistic methods in combinatorial optimization. Random Structures Algorithms 20 317-342.
27. KIM, J. H. and VU, V. H. (2004). Divide and conquer martingales and the number of triangles in a random graph. Random Structures Algorithms 24 166-174.
28. LATAŁA, R. and OLESZKIEWICZ, K. (2000). Between Sobolev and Poincaré. In Geometric Aspects of Functional Analysis. Lecture Notes in Math. 1745 147-168. Springer, Berlin.
29. LEDOUX, M. (2001). The Concentration of Measure Phenomenon. Mathematical Surveys and Monographs 89. Amer. Math. Soc., Providence, RI.
30. MARTIN-LÖF, A. (1982). A Laplace approximation for sums of independent random variables. Z. Wahrsch. Verw. Gebiete 59 101-115.
31. ONSAGER, L. (1944). Crystal statistics. I. A two-dimensional model with an order-disorder transition. Phys. Rev. (2) 65 117-149.
32. PARK, J. and NEWMAN, M. E. J. (2004). Statistical mechanics of networks. Phys. Rev. E (3) 70 066117-066122.
33. PARK, J. and NEWMAN, M. E. J. (2005). Solution for the properties of a clustered network. Phys. Rev. E 72 026136-026137.
34. RAIČ, M. (2007). CLT-related large deviation bounds based on Stein's method. Adv. in Appl. Probab. 39 731-752.
35. 2 field theory as a classical Ising model. Comm. Math. Phys. 33 145-164.
36. STEIN, C. (1972). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In Proc. Sixth Berkeley Symp. Math. Statist. Probab. Vol. II: Probability Theory 583-602. Univ. California Press, Berkeley, CA.
37. STEIN, C. (1986). Approximate Computation of Expectations. IMS, Hayward, CA.
38. TALAGRAND, M. (1995). Concentration of measure and isoperimetric inequalities in product spaces. Publ. Math. Inst. Hautes Études Sci. 81 73-205.
39. VU, V. H. (2001). A large deviation result on the number of small subgraphs of a random graph. Combin. Probab. Comput. 10 79-94.