Open Collections

Heaps, graphical models, and random walk representations

University of British Columbia

Spin systems such as the Ising model are central topics in statistical mechanics and probability theory. In the late 1960s Symanzik made the important discovery that properties of spin systems could be expressed in terms of the behaviour of random walks. This thesis contributes to the understanding of these connections by developing and analyzing random walk representations of graphical models arising in statistical mechanics. Concretely, the results of this thesis can be divided into two parts. The first part is a lace expansion analysis of a model called loop-weighted walk. Loop-weighted walk is a non-Markovian model of random walks that are discouraged (or encouraged), depending on the value of a parameter ⋋ ≥ 0, from completing loops. The model arises naturally as a random walk representation of correlations in a statistical mechanics model called the cycle gas. A challenging aspect of this model is that it is not repulsive, meaning the weight of the future of a walk may either increase or decrease if the past is forgotten. The second part of this thesis is an essentially elementary derivation of a random walk representation for the partition function of the Ising model on any finite graph. Such representations have a long history for planar graphs. For non-planar graphs the additional ingredient needed is a way to compute the intersection numbers of curves on surfaces. The representations for non-planar graphs lead to random walk representations of spin-spin correlation functions that were previously unknown.

Text

2015-01-06

Attribution-NonCommercial-NoDerivs 2.5 Canada

http://hdl.handle.net/2429/51774

Mathematics

University of British Columbia

UBCV

http://creativecommons.org/licenses/by-nc-nd/2.5/ca/