2000 character limit reached
Ising Model Observables and Non-Backtracking Walks (1209.3996v3)
Published 18 Sep 2012 in math.CO and math.PR
Abstract: This paper presents an alternative proof of the connection between the partition function of the Ising model on a finite graph $G$ and the set of non-backtracking walks on $G$. The techniques used also give formulas for spin-spin correlation functions in terms of non-backtracking walks. The main tools used are Viennot's theory of heaps of pieces and turning numbers on surfaces.
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.