2000 character limit reached
Non-backtracking loop soups and statistical mechanics on spin networks (1507.05065v3)
Published 17 Jul 2015 in math-ph, cond-mat.stat-mech, math.MP, and math.PR
Abstract: We introduce and study a Markov field on the edges of a graph in dimension $d\geq2$ whose configurations are spin networks. The field arises naturally as the edge-occupation field of a Poissonian model (a soup) of non-backtracking loops and walks characterized by a spatial Markov property such that, conditionally on the value of the edge-occupation field on a boundary set, the distributions of the loops and arcs on either side of the boundary are independent of each other. The field has a Gibbs distribution with a Hamiltonian given by a sum of terms which involve only edges incident on the same vertex. Its free energy density and other quantities can be computed exactly, and their critical behavior analyzed, in any dimension.