Weighted dependency graphs and the Ising model
Let \(X_1,\dots,X_r\) be random variables with finite moments on the same probability space. Their joint cumulant of order \(r\) is defined as \(\kappa(X_1,\dots,X_r)=[t_1,...,t_r]\log \langle \exp (t_1X_1,\dots,t_r X_r)\rangle\), where \(\langle Y\rangle\) denotes the expectation of \(Y\) and the notation \([t_1,\dots,t_r]F\) stands for the coefficient of \(t_1,\dots,t_r\) in the series expansion of \(F\). Bounds on cumulants are called cluster properties. In this excellent paper, taking into account these bounds on cumulants, the authors prove central limit theorems (CLT) for patterns in the Ising model. They give a simpler and more unified approach of the decays of joint cumulants in several regimes. The authors use the cluster expansion in three different regimes of the Ising model to prove the bounds on joint cumulants. By using the weighted dependency graph technique, they prove new central limit theorems. A CLT for local patterns is proved. In the last section, the authors use the bounds on cumulants to show that the family of random variables \(\{\sigma_i:i\in \mathbb{Z}^{d}\}\) has a weighted dependency graph.
- Central limit theorems for some set partition statistics
- Decrease properties of truncated correlation functions and analyticity properties for classical lattices and continuous systems
- scientific article; zbMATH DE number 3903723 (Why is no real title available?)
- On normal approximations of distributions in terms of dependency graphs
- On three different notions of monotone subsequences
- The probability of avoiding consecutive patterns in the Mallows distribution
This page was built for publication: Weighted dependency graphs and the Ising model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286573)
