skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Ising model observables and non-backtracking walks

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.

Authors:
 [1]
  1. Department of Mathematics, The University of British Columbia, Vancouver, British Columbia V6T 1Z2 (Canada)
Publication Date:
OSTI Identifier:
22306201
Resource Type:
Journal Article
Resource Relation:
Journal Name: Journal of Mathematical Physics; Journal Volume: 55; Journal Issue: 8; Other Information: (c) 2014 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ALGORITHMS; CORRELATION FUNCTIONS; ISING MODEL; PARTITION FUNCTIONS; QUANTUM MECHANICS; SPIN; TWO-DIMENSIONAL CALCULATIONS

Citation Formats

Helmuth, Tyler, E-mail: jhelmt@math.ubc.ca. Ising model observables and non-backtracking walks. United States: N. p., 2014. Web. doi:10.1063/1.4881723.
Helmuth, Tyler, E-mail: jhelmt@math.ubc.ca. Ising model observables and non-backtracking walks. United States. doi:10.1063/1.4881723.
Helmuth, Tyler, E-mail: jhelmt@math.ubc.ca. Fri . "Ising model observables and non-backtracking walks". United States. doi:10.1063/1.4881723.
@article{osti_22306201,
title = {Ising model observables and non-backtracking walks},
author = {Helmuth, Tyler, E-mail: jhelmt@math.ubc.ca},
abstractNote = {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.},
doi = {10.1063/1.4881723},
journal = {Journal of Mathematical Physics},
number = 8,
volume = 55,
place = {United States},
year = {Fri Aug 15 00:00:00 EDT 2014},
month = {Fri Aug 15 00:00:00 EDT 2014}
}
  • We present preliminary results of our numerical study of the critical dynamics of percolation observables for the two-dimensional Ising model. We consider the (Monte-Carlo) short-time evolution of the system obtained with a local heat-bath method and with the global Swendsen-Wang algorithm. In both cases, we find qualitatively different dynamic behaviors for the magnetization and {omega}, the order parameter of the percolation transition. This may have implications for the recent attempts to describe the dynamics of the QCD phase transition using cluster observables.
  • Cited by 6
  • In this paper, we consider reaction-diffusion processes in which it is assumed that a migrating species (A) is subject to an interaction potential and may undertake nonnearest neighbor jumps in its diffusion towards a reaction center (B). For the case that the species A and B react irreversibly upon first encounter, we show how the efficiency of the process A+B ..-->.. C is influenced by the nature of the interaction potential (a power law of the form V (r) = r/sup -s/ with r>0 and 1< or =s< or =12) and the geometry (dimensionality and spatial extent) of the reactionmore » space assumed. Our approach is based on a recently introduced, exact theory of d-dimensional walks on finite and infinite (periodic) lattices with traps and, accordingly, the results presented in this study provide an exact quantitation of the interplay between potential interactions and system geometry for the reaction-diffusion problems considered. The results reported here may have considerable relevance to the problems of exciton migration in crystals, photosynthesis, and the surface diffusion of adatoms.« less
  • The authors present the first backtracking algorithm for stream AND-parallel logic programs. It relies on compile-time knowledge of the data flow graph of each clause to let it figure out efficiently which goals to kill or restart when a goal fails. This crucial information, which they derive from mode declarations, was not available at compile-time in any previous stream AND-parallel system. They show that modes can increase the precision of the backtracking algorithm, though their algorithm allows this precision to be traded off against overhead on a procedure-by-procedure and call-by-call basis. The modes also allow their algorithm to handle efficientlymore » programs that manipulate partially instantiated data structures and an important class of programs with circular dependency graphs. On code that does not need backtracking, the efficiency of their algorithm approaches that of the committed-choice languages; on code that does need backtracking its overhead is comparable to that of the independent AND-parallel backtracking algorithms.« less
  • We introduce the quantum stochastic walk (QSW), which determines the evolution of a generalized quantum-mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all possible quantum, classical, and quantum-stochastic transitions from a vertex as defined by its connectivity. We show how the family of possible QSWs encompasses both the classical random walk (CRW) and the quantum walk (QW) as special cases but also includes more general probability distributions. As an example, we study the QSW on a line and the glued tree of depth three to observemore » the behavior of the QW-to-CRW transition.« less