2000 character limit reached
Weighted dependency graphs and the Ising model (1610.05082v3)
Published 17 Oct 2016 in math.PR, math-ph, math.CO, and math.MP
Abstract: Weighted dependency graphs have been recently introduced by the second author, as a toolbox to prove central limit theorems. In this paper, we prove that spins in the $d$-dimensional Ising model display such a weighted dependency structure. We use this to obtain various central limit theorems for the number of occurrences of local and global patterns in a growing box.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.