Project Euclid

References

• Ali, W., Rito, T., Reinert, G., Sun, F. and Deane, C. M. (2014). Alignment-free protein interaction network comparison. Bioinformatics 30 i430–i437.
• Barbour, A. D. (1988). Stein’s method and Poisson process convergence. A celebration of applied probability. J. Appl. Probab. 25 175–184.
• Barbour, A. D. (1990). Stein’s method for diffusion approximations. Probab. Theory Related Fields 84 297–322.
  Zentralblatt MATH: 0665.60008
  Digital Object Identifier: doi:10.1007/BF01197887
  
• Barbour, A. D. and Chen, L. H. Y., eds. (2005). An Introduction to Stein’s Method. Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore 4. World Scientific, Hackensack, NJ.
• Barbour, A. D., Röllin, A. and Ross, N. (2019). Error bounds in local limit theorems using Stein’s method. Bernoulli 25 1076–1104.
  Zentralblatt MATH: 07049400
  Digital Object Identifier: doi:10.3150/17-BEJ1013
  Project Euclid: euclid.bj/1551862844
  
• Bhamidi, S., Bresler, G. and Sly, A. (2011). Mixing time of exponential random graphs. Ann. Appl. Probab. 21 2146–2170.
  Zentralblatt MATH: 1238.60011
  Digital Object Identifier: doi:10.1214/10-AAP740
  Project Euclid: euclid.aoap/1322057318
  
• Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T. and Vesztergombi, K. (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801–1851.
  Zentralblatt MATH: 1213.05161
  Digital Object Identifier: doi:10.1016/j.aim.2008.07.008
  
• Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T. and Vesztergombi, K. (2012). Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 151–219.
  Zentralblatt MATH: 1247.05124
  Digital Object Identifier: doi:10.4007/annals.2012.176.1.2
  
• Bresler, G. and Nagaraj, D. (2017). Stein’s method for stationary distributions of Markov chains and application to Ising models. Preprint. Available at arXiv:1712.05743.
  arXiv: 1712.05743
  
• Bubley, R. and Dyer, M. (1997). Path coupling: A technique for proving rapid mixing in Markov chains. In Proceedings 38th Annual Symposium on Foundations of Computer Science 223–231.
• Chatterjee, S. (2005). Concentration Inequalities with Exchangeable Pairs. ProQuest LLC, Ann Arbor, MI. Thesis (Ph.D.)—Stanford University. Available at arXiv:math/0507526.
• Chatterjee, S. (2007). Stein’s method for concentration inequalities. Probab. Theory Related Fields 138 305–321.
  Zentralblatt MATH: 1116.60056
  Digital Object Identifier: doi:10.1007/s00440-006-0029-y
  
• Chatterjee, S. (2016). An introduction to large deviations for random graphs. Bull. Amer. Math. Soc. (N.S.) 53 617–642.
  Zentralblatt MATH: 1356.60044
  Digital Object Identifier: doi:10.1090/bull/1539
  
• Chatterjee, S. and Dembo, A. (2016). Nonlinear large deviations. Adv. Math. 299 396–450.
  Zentralblatt MATH: 1356.60045
  Digital Object Identifier: doi:10.1016/j.aim.2016.05.017
  
• Chatterjee, S. and Diaconis, P. (2013). Estimating and understanding exponential random graph models. Ann. Statist. 41 2428–2461.
  Zentralblatt MATH: 1293.62046
  Digital Object Identifier: doi:10.1214/13-AOS1155
  Project Euclid: euclid.aos/1383661269
  
• Chatterjee, S. and Shao, Q.-M. (2011). Nonnormal approximation by Stein’s method of exchangeable pairs with application to the Curie–Weiss model. Ann. Appl. Probab. 21 464–483.
  Zentralblatt MATH: 1216.60018
  Digital Object Identifier: doi:10.1214/10-AAP712
  Project Euclid: euclid.aoap/1300800979
  
• Chen, L. H. Y., Goldstein, L. and Shao, Q.-M. (2011). Normal Approximation by Stein’s Method. Probability and Its Applications (New York). Springer, Heidelberg.
• Dobrushin, R. L. and Shlosman, S. B. (1985). Constructive criterion for the uniqueness of Gibbs field. In Statistical Physics and Dynamical Systems (Köszeg, 1984). Progress in Probability 10 347–370. Birkhäuser, Boston, MA.
  Zentralblatt MATH: 0569.46042
  
• Dobrushin, R. L. (1970). Definition of a system of random variables by means of conditional distributions. Theory Probab. Appl. 15 458–486.
  Zentralblatt MATH: 0264.60037
  Digital Object Identifier: doi:10.1137/1115049
  
• Dyer, M., Goldberg, L. A. and Jerrum, M. (2009). Matrix norms and rapid mixing for spin systems. Ann. Appl. Probab. 19 71–107.
  Zentralblatt MATH: 1166.15015
  Digital Object Identifier: doi:10.1214/08-AAP532
  Project Euclid: euclid.aoap/1235140333
  
• Eichelsbacher, P. and Löwe, M. (2010). Stein’s method for dependent random variables occurring in statistical mechanics. Electron. J. Probab. 15 962–988.
• Eichelsbacher, P. and Reinert, G. (2008). Stein’s method for discrete Gibbs measures. Ann. Appl. Probab. 18 1588–1618.
  Zentralblatt MATH: 1146.60011
  Digital Object Identifier: doi:10.1214/07-AAP0498
  Project Euclid: euclid.aoap/1216677133
  
• Eldan, R. (2018). Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations. Geom. Funct. Anal. 28 1548–1596.
  Zentralblatt MATH: 06993379
  Digital Object Identifier: doi:10.1007/s00039-018-0461-z
  
• Eldan, R. and Gross, R. (2018a). Decomposition of mean-field Gibbs distributions into product measures. Electron. J. Probab. 23 Paper No. 35, 24.
  Zentralblatt MATH: 1390.60346
  Digital Object Identifier: doi:10.1214/18-EJP159
  
• Eldan, R. and Gross, R. (2018b). Exponential random graphs behave like mixtures of stochastic block models. Ann. Appl. Probab. 28 3698–3735.
  Zentralblatt MATH: 1407.62226
  Digital Object Identifier: doi:10.1214/18-AAP1402
  Project Euclid: euclid.aoap/1538985633
  
• Ellis, R. S. (2006). Entropy, Large Deviations, and Statistical Mechanics. Classics in Mathematics. Springer, Berlin.
  Zentralblatt MATH: 1102.60087
  
• 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.
  Zentralblatt MATH: 0364.60120
  Digital Object Identifier: doi:10.1007/BF00533049
  
• Ellis, R. S., Newman, C. M. and Rosen, J. S. (1980). Limit theorems for sums of dependent random variables occurring in statistical mechanics. II. Conditioning, multiple phases, and metastability. Z. Wahrsch. Verw. Gebiete 51 153–169.
  Zentralblatt MATH: 0404.60096
  Digital Object Identifier: doi:10.1007/BF00536186
  
• Frank, O. and Strauss, D. (1986). Markov graphs. J. Amer. Statist. Assoc. 81 832–842.
  Zentralblatt MATH: 0607.05057
  Digital Object Identifier: doi:10.1080/01621459.1986.10478342
  
• Gheissari, R., Lubetzky, E. and Peres, Y. (2018). Concentration inequalities for polynomials of contracting Ising models. Electron. Commun. Probab. 23 Paper No. 76, 12.
  Zentralblatt MATH: 1405.82009
  Digital Object Identifier: doi:10.1214/18-ECP173
  
• Hayes, T. P. (2006). A simple condition implying rapid mixing of single-site dynamics on spin systems. In Proc. 47th Annual IEEE Symposium on Foundations of Computer Science FOCS ’06 39–46. IEEE Computer Society, Washington, DC.
• Holland, P. W. and Leinhardt, S. (1981). An exponential family of probability distributions for directed graphs. J. Amer. Statist. Assoc. 76 33–65.
  Zentralblatt MATH: 0457.62090
  Digital Object Identifier: doi:10.1080/01621459.1981.10477598
  
• Levin, D. A., Luczak, M. J. and Peres, Y. (2010). Glauber dynamics for the mean-field Ising model: Cut-off, critical power law, and metastability. Probab. Theory Related Fields 146 223–265.
  Zentralblatt MATH: 1187.82076
  Digital Object Identifier: doi:10.1007/s00440-008-0189-z
  
• Levin, D. A., Peres, Y. and Wilmer, E. L. (2009). Markov Chains and Mixing Times. Amer. Math. Soc., Providence, RI.
  Zentralblatt MATH: 1160.60001
  
• Ley, C., Reinert, G. and Swan, Y. (2017). Stein’s method for comparison of univariate distributions. Probab. Surv. 14 1–52.
  Zentralblatt MATH: 1406.60010
  Digital Object Identifier: doi:10.1214/16-PS278
  
• Luczak, M. J. (2008). Concentration of measure and mixing for Markov chains. In Fifth Colloquium on Mathematics and Computer Science. Discrete Math. Theor. Comput. Sci. Proc., AI 95–120. Assoc. Discrete Math. Theor. Comput. Sci., Nancy.
  Zentralblatt MATH: 1357.60075
  
• Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D. and Alon, U. (2002). Network motifs: Simple building blocks of complex networks. Science 298 824–827.
• Mossel, E. and Sly, A. (2013). Exact thresholds for Ising–Gibbs samplers on general graphs. Ann. Probab. 41 294–328.
  Zentralblatt MATH: 1270.60113
  Digital Object Identifier: doi:10.1214/11-AOP737
  Project Euclid: euclid.aop/1358951988
  
• Padgett, J. F. and Ansell, C. K. (1993). Robust action and the rise of the Medici, 1400–1434. Amer. J. Sociol. 98 1259–1319.
• Picard, F., Daudin, J.-J., Koskas, M., Schbath, S. and Robin, S. (2008). Assessing the exceptionality of network motifs. J. Comput. Biol. 15 1–20.
• Pržulj, N. (2007). Biological network comparison using graphlet degree distribution. Bioinformatics 23 e177–e183.
• Radin, C. and Yin, M. (2013). Phase transitions in exponential random graphs. Ann. Appl. Probab. 23 2458–2471.
  Zentralblatt MATH: 1278.05225
  Digital Object Identifier: doi:10.1214/12-AAP907
  Project Euclid: euclid.aoap/1382447694
  
• Reinert, G. (2005). Three general approaches to Stein’s method. In An Introduction to Stein’s Method. Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap. 4 183–221. Singapore Univ. Press, Singapore.
• Rinott, Y. and Rotar, V. (1997). On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted $U$-statistics. Ann. Appl. Probab. 7 1080–1105.
  Zentralblatt MATH: 0890.60019
  Digital Object Identifier: doi:10.1214/aoap/1043862425
  Project Euclid: euclid.aoap/1043862425
  
• Röllin, A. and Ross, N. (2015). Local limit theorems via Landau–Kolmogorov inequalities. Bernoulli 21 851–880.
• Ross, N. (2011). Fundamentals of Stein’s method. Probab. Surv. 8 210–293.
  Zentralblatt MATH: 1245.60033
  Digital Object Identifier: doi:10.1214/11-PS182
  
• Ruciński, A. (1988). When are small subgraphs of a random graph normally distributed? Probab. Theory Related Fields 78 1–10.
• Sinulis, A. (2018). Mixing times of Glauber dynamics via entropy methods. Preprint. Available at arXiv:1804.04424.
  arXiv: 1804.04424
  
• Stein, C. (1972). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability (Univ. California, Berkeley, Calif., 1970/1971), Vol. II: Probability Theory 583–602. Univ. California Press, Berkeley, CA.
• Stein, C. (1986). Approximate Computation of Expectations. Institute of Mathematical Statistics Lecture Notes—Monograph Series 7. IMS, Hayward, CA.
  Zentralblatt MATH: 0721.60016
  
• Wasserman, S. and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge Univ. Press, Cambridge.
  Zentralblatt MATH: 0926.91066
  
• Yin, M. (2013). Critical phenomena in exponential random graphs. J. Stat. Phys. 153 1008–1021.
  Zentralblatt MATH: 1285.82024
  Digital Object Identifier: doi:10.1007/s10955-013-0874-x