2000 character limit reached
Annealed limit theorems for the ising model on random regular graphs
Published 30 Jan 2017 in math.PR, cond-mat.stat-mech, math-ph, and math.MP | (1701.08639v2)
Abstract: In a paper [15], Giardin{`a}, Giberti, Hofstad, Prioriello have proved a law of large number and a central limit theorem with respect to the annealed measure for the magnetization of the Ising model on some random graphs including the random 2-regular graph. We present a new proof of their results, which applies to all random regular graphs. In addition, we prove the existence of annealed pressure in the case of configuration model random graphs.
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.