On Exactly Solvable Lattice Models and Their Mathematical Properties

Self-avoiding walks (SAWs) and loop-erased random walks (LERWs) are two ensembles of random paths with numerous applications in mathematics, statistical physics and quantum field theory. While SAWs are described by the n→0 limit of ϕ4-theory with O(n)-symmetry, LERWs have no obvious field-theoretic description. We analyse two candidates for a field theory of LERWs, and discover a connection between the corresponding and a priori unrelated theories. The first such candidate is the O(n)-symmetric ϕ4 theory at n=−2 whose link to LERWs was known in two dimensions due to conformal field theory. Here it is established in arbitrary dimension via a perturbation expansion in the coupling constant. The second candidate is a field theory for charge-density waves pinned by quenched disorder, whose relation to LERWs had been conjectured earlier using analogies with Abelian sandpiles. We explicitly show that both theories yield identical results to 4-loop order and give both a perturbative and a non-perturbative proof of their equivalence. This allows us to compute the fractal dimension of LERWs to order ε5 where ε=4−d. In particular, in d=3 our theory gives zLERW(d=3)=1.6243±0.001, in excellent agreement with the estimate z=1.62400±0.00005 of numerical simulations.

Birman–Murakami–Wenzl (BMW) algebra was introduced in connection with knot theory. We treat here interaction round the face solvable (IRF) lattice models. We assume that the face transfer matrix obeys a cubic polynomial equation, which is called the three block case. We prove that the three block theories all obey the BMW algebra. We exemplify this result by treating in detail the SU(2)2×2 fused models, and showing explicitly the BMW structure. We use the connection between the construction of solvable lattice models and conformal field theory. This result is important to the solution of IRF lattice models and the development of new models, as well as to knot theory.

Solvable lattice models with broken [formula omitted] symmetry and Hecke's indefinite modular forms

In this paper we extend the loop‐erased random walk (LERW) to the directed hypergraph setting. We then generalize Wilson's algorithm for uniform sampling of spanning trees to directed hypergraphs. In several special cases, this algorithm perfectly samples spanning hypertrees in expected polynomial time. Our main application is to the reachability problem, also known as the directed all‐terminal network reliability problem. This classical problem is known to be # P‐complete, hence is most likely intractable (Ball and Provan, SIAM J Comput 12 (1983) 777–788). We show that in the case of bi‐directed graphs, a conjectured polynomial bound for the expected running time of the generalized Wilson algorithm implies a FPRAS for approximating reachability. Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 201‐223, 2014

We define multi-colour generalizations of braid-monoid algebras and present explicit matrix representations which are related to two-dimensional exactly solvable lattice models of statistical mechanics. In particular, we show that the two-colour braid-monoid algebra describes the Yang-Baxter algebra of the critical dilute A-D-E models which were recently introduced by Warnaar, Nienhuis, and Seaton as well as by Roche. These and other solvable models related to dense and dilute loop models are discussed in detail and it is shown that the solvability is a direct consequence of the algebraic structure. It is conjectured that the Yang-Baxterization of general multi-colour braid-monoid algebras will lead to the construction of further solvable lattice models.

The loop-erased random walk (LERW) in $\mathbb{Z}^{4}$ is the process obtained by erasing loops chronologically for a simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost surely and in $L^{p}$ for all $p>0$. Along the way, we extend previous results by the first author building on slowly recurrent sets. We provide two applications for the escape probability. We construct the two-sided LERW, and we construct a $\pm 1$ spin model coupled with the wired spanning forests on $\mathbb{Z}^{4}$ with the bi-Laplacian Gaussian field on $\mathbb{R}^{4}$ as its scaling limit.

Abelian avalanches and Tutte polynomials

Let M be the infinite spanning-tree-weighted random planar map, which is the local limit of finite random planar maps sampled with probability proportional to the number of spanning trees they admit. We show that a.s. the M-graph-distance diameter of the external diffusion-limited aggregation (DLA) cluster on M run for m steps is of order m2/d+om(1), where d is the metric ball volume growth exponent for M (which was shown to exist by Ding and Gwynne (Comm. Math. Phys. 374 (2020) 1877–1934). By known bounds for d, one has 0.55051⋯≤2/d≤0.563315…. Along the way, we also prove that loop-erased random walk (LERW) on M typically travels graph distance m2/d+om(1) in m units of time and that the graph-distance diameter of a finite spanning-tree-weighted random planar map with n edges, with or without boundary, is of order n1/d+on(1) except on an event with probability decaying faster than any negative power of n. Our proofs are based on a special relationship between DLA and LERW on spanning-tree-weighted random planar maps as well as estimates for distances in such maps which come from the theory of Liouville quantum gravity.

Comments that the Laplacian random walk with eta =1, recently introduced by Lyklema and Evertsz (1986), is the same process as the loop-erased self-avoiding random walk analysed previously by the author (1980). Some rigorous results about this process are reviewed.

Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent loop-erased random walk both started at the origin do not intersect up to leaving the ball of radius $n$. This allows us to show that there exists $C$ such that for all $n$ and all $k=1,2,...,\mathbf{E}[M_n^k]\leq C^kk!\mathbf{E}[M_n]^k$ and hence to establish exponential moment bounds for $M_n$. This implies that there exists $c>0$ such that for all $n$ and all $\lambda\geq0$, \[\mathbf{P}\{M_n>\lambda\mathbf{E}[M_n]\}\leq2e^{-c\lambda}.\] Using similar techniques, we then establish a second moment result for a specific conditioned random walk which enables us to prove that for any $\alpha<4/5$, there exist $C$ and $c'>0$ such that for all $n$ and $\lambda>0$, \[\mathbf{P}\{M_n<\lambda^{-1}\mathbf{E}[M_n]\}\leq Ce^{-c'\lambda ^{\alpha}}.\]

We show that the ‘erasing-larger-loops-first’ (ELLF) method, which was first introduced for erasing loops from the simple random walk on the Sierpiński gasket, does work also for non-Markov random walks, in particular, self-repelling walks to construct a new family of self-avoiding walks on the Sierpiński gasket. The one-parameter family constructed in this method continuously connects the loop-erased random walk and a self-avoiding walk which has the same asymptotic behavior as the ‘standard’ self-avoiding walk. We prove the existence of the scaling limit and study some path properties: The exponent $ν$ governing the short-time behavior of the scaling limit varies continuously in the parameter. The limit process is almost surely self-avoiding, while it has path Hausdorff dimension $1/ν $, which is strictly greater than $1$.

A series of solvable lattice models with face interaction are introduced on the basis of the affine Lie algebraXn(1)=An(1),Bn(1),Cn(1),Dn(1). The local states taken on by the fluctuation variables are the dominant integral weights ofXn(1) of a fixed level. Adjacent local states are subject to a condition related to the vector representation ofXn. The Boltzmann weights are parametrized by elliptic theta functions and solve the star-triangle relation.

Kitaev’s quantum double model is a family of exactly solvable lattice models that realize two dimensional topological phases of matter. The model was originally based on finite groups, and was later generalized to semi-simple Hopf algebras. We rigorously define and study ribbon operators in the generalized quantum double model. These ribbon operators are important tools to understand quasi-particle excitations. It turns out that there are some subtleties in defining the operators in contrast to what one would naively think of. In particular, one has to distinguish two classes of ribbons which we call locally clockwise and locally counterclockwise ribbons. Moreover, we point out that the issue already exists in the original model based on finite non-abelian groups, but it seems to not have been noticed in the literature. We show how certain common properties would fail even in the original model if we were not to distinguish these two classes of ribbons. Perhaps not surprisingly, under the new definitions ribbon operators satisfy all properties that are expected. For instance, they create quasi-particle excitations only at the end of the ribbon, and the types of the quasi-particles correspond to irreducible representations of the Drinfeld double of the input Hopf algebra. However, the proofs of these properties are much more complicated than those in the case of finite groups. This is partly due to the complications in dealing with general Hopf algebras rather than group algebras.

2p-D-15 Solvable lattice models and N=2 superconformal algebra

We introduce and study twelve multivariable theta functions defined by pfaffians with elliptic function entries. We show that, when the crossing parameter is a cubic root of unity, the domain wall partition function for the eight-vertex-solid-on-solid model can be written as a sum of two of these pfaffians. As a limit case, we express the domain wall partition function for the three-colour model as a sum of two Hankel determinants. We also show that certain solutions of the TQ-equation for the supersymmetric eight-vertex model can be expressed in terms of elliptic pfaffians.