Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 85 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 419 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Malliavin structure for conditionally independent random variables (2404.03931v1)

Published 5 Apr 2024 in math.PR

Abstract: On any denumerable product of probability spaces, we extend the discrete Malliavin structure for conditionally independent random variables. As a consequence, we obtain the chaos decomposition for functionals of conditionally independent random variables. We also show how to derive some concentration results in that framework. The Malliavin-Stein method yields Berry-Esseen bounds for U-Statistics of such random variables. It leads to quantitative statements of conditional limit theorems: Lyapunov's central limit theorem, De Jong's limit theorem for multilinear forms. The latter is related to the fourth moment phenomenon. The final application consists of obtaining the rates of normal approximation for subhypergraph counts in random exchangeable hypergraphs including the Erd{\"o}s-R{\'e}nyi hypergraph model. The estimator of subhypergraph counts is an example of homogeneous sums for which we derive a new decomposition that extends the Hoeffding decomposition.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. Tim Austin. On exchangeable random variables and the statistics of large graphs and hypergraphs. Probability Surveys, 5(none):80–145, January 2008.
  2. Fourth moment theorems for Markov diffusion generators. Journal of Functional analysis, 266(4):2341–2359, 2014.
  3. A central limit theorem for decomposable random variables with applications to random graphs. Journal of Combinatorial Theory, Series B, 47(2):125–145, 1989.
  4. Sourav Chatterjee. A new method of normal approximation. The Annals of Probability, 36(4):1584–1610, 2008.
  5. Peter De Jong. A Central Limit Theorem for Generalized Multilinear Forms. Journal of Multivariate Analysis, 34(2):275–289, 1990.
  6. Peter De Jong. A Central Limit Theorem with Applications to Random Hypergraphs. Random Structures and Algorithms, 8(2):105–120, 1996.
  7. Laurent Decreusefond. The Stein-Dirichlet-Malliavin method. ESAIM: Proceedings and Surveys, 51:49–59, 2015.
  8. Laurent Decreusefond. Selected Topics in Malliavin Calculus: Chaos, Divergence and So Much More. Springer Nature, 2022.
  9. Malliavin and Dirichlet structures for independent random variables. Stochastic Processes and their Applications, 129(8):2611–2653, August 2019.
  10. Quantitative de Jong theorems in any dimension. Electronic Journal of Probability, 22, 2017.
  11. Quantitative CLTs for symmetric U𝑈{U}italic_U-statistics using contractions. Electronic Journal of Probability, 24, 2019.
  12. Richard M. Dudley. Real Analysis and Probability. Cambridge studies in advanced mathematics. Cambridge University Press, 2002.
  13. Mitia Duerinckx. On the size of chaos via Glauber calculus in the classical mean-field dynamics. Communications in Mathematical Physics, pages 1–41, 2021.
  14. Nguyen Tien Dung. Poisson and normal approximations for the measurable functions of independent random variables. arXiv preprint arXiv:1807.10925, 2018.
  15. Nguyen Tien Dung. Rates of convergence in the central limit theorem for nonlinear statistics under relaxed moment conditions. Acta Mathematica Vietnamica, pages 1–26, 2021.
  16. The jackknife estimate of variance. The Annals of Statistics, pages 586–596, 1981.
  17. Wassily Hoeffding. A class of statistics with asymptotically normal distribution. The Annals of Mathematical Statistics, pages 293–325, 1948.
  18. Concentration and deviation inequalities in infinite dimensions via covariance representations. Bernoulli, 8(6):697–720, 2002.
  19. Random Graphs. John Wiley & Sons, Inc., 2000.
  20. The asymptotic distributions of generalized U𝑈{U}italic_U-statistics with applications to random graphs. Probability theory and related fields, 90(3):341–375, 1991.
  21. Olav Kallenberg. Foundations of Modern Probability. Springer, 1997.
  22. Higher-order fluctuations in dense random graph models. Electronic Journal of Probability, 26:1–36, 2021.
  23. Discrete Malliavin–Stein method: Berry–Esseen bounds for random graphs and percolation. The Annals of Probability, 45(2):1071–1109, 2017.
  24. New Berry–Esseen bounds for functionals of binomial point processes. The Annals of Applied Probability, 27(4):1992–2031, 2017.
  25. Michel Ledoux. Chaos of a Markov operator and the fourth moment condition. Annals of Probability, 40(6):2439–2459, 2012.
  26. László Lovász. Large networks and graph limits, volume 60. American Mathematical Soc., 2012.
  27. Colin McDiarmid. On the method of bounded differences. Surveys in combinatorics, 141(1):148–188, 1989.
  28. Normal approximations with Malliavin calculus: from Stein’s method to universality. Number 192 in Cambridge Tracts in Mathematics. Cambridge University Press, 2012.
  29. Nicolas Privault. Stochastic analysis of Bernoulli processes. Probability Surveys, 5:435–483, 2008.
  30. Normal approximation for sums of discrete U𝑈Uitalic_U-statistics – Application to Kolmogorov bounds in random subgraph counting. Bernoulli, 26(1):587–615, 2020.
  31. Berry-Esseen bounds for functionals of independent random variables. Electronic Journal of Probability, 27:1–37, 2022.
  32. B.L.S. Prakasa Rao. Conditional independence, conditional mixing and conditional association. Annals of the Institute of Statistical Mathematics, 61(2):441–460, 2009.
  33. Stein’s method and stochastic analysis of Rademacher functionals. Electronic Journal of Probability, 15:1703–1742, 2010.
  34. Andrzej Ruciński. When are small subgraphs of a random graph normally distributed? Probability Theory and Related Fields, 78(1):1–10, 1988.
  35. Adrian Röllin. Kolmogorov bounds for the normal approximation of the number of triangles in the Erdos-Rényi random graph. Probability in the Engineering and Informational Sciences, 36(3):747–773, 2022.
  36. Multivariate Central Limit Theorems for Random Clique Complexes, June 2022. arXiv:2112.08922 [math] type: article.
  37. Kösaku Yosida. Functional Analysis. Classics in Mathematics. Springer Berlin Heidelberg, 1995.
  38. Zhuo-Song Zhang. Berry–Esseen bounds for generalized U𝑈Uitalic_U-statistics. Electronic Journal of Probability, 27:1–36, 2022.
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

List Streamline Icon: https://streamlinehq.com Explore 10 Community Prompts
Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets