February 13, 2002
On a periodic planar graph whose edge weights satisfy a certain simple geometric condition, the discrete Laplacian and d-bar operators have the property that their determinants and inverses only depend on the local geometry of the graph. We obtain explicit expressions for the logarithms of the (normalized) determinants, as well as the inverses of these operators. We relate the logarithm of the determinants to the volume plus mean curvature of an associated hyperbolic ideal polyhedron. In the associated dimer and spanning tree models, for which the determinants of d-bar and the Laplacian respectively play the role of the partition function, this allows us to compute the entropy and correlations in terms of the local geometry. In addition, we define a continuous family of special discrete analytic functions, which, via convolutions gives a general process for constructing discrete analytic functions and discrete harmonic functions on critical planar graphs.
Similar papers 1
February 13, 2017
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures arise naturally from the laplacian on the graph. More generally these results hold for the "massive" laplacian determinant which counts rooted spanning forests with weight $M$ per finite component. These measures typically have a form of con...
January 28, 2011
The Kac-Ward formula allows to compute the Ising partition function on any finite graph G from the determinant of 2^{2g} matrices, where g is the genus of a surface in which G embeds. We show that in the case of isoradially embedded graphs with critical weights, these determinants have quite remarkable properties. First of all, they satisfy some generalized Kramers-Wannier duality: there is an explicit equality relating the determinants associated to a graph and to its dual g...
January 9, 2015
We study combinatorial Laplacians on rectangular subgraphs of $ \epsilon \mathbb{Z}^2 $ that approximate Laplace-Beltrami operators of Riemannian metrics as $ \epsilon \rightarrow 0 $. These laplacians arise as follows: we define the notion of a Riemmanian metric structure on a graph. We then define combinatorial free field theories and describe how these can be regarded as finite dimensional approximations of scalar field theory. We focus on the Gaussian field theory on rect...
March 6, 2012
These are lecture notes for the Current Developments in Mathematics conference at Harvard, November, 2011. We discuss topological, probabilistic and combinatorial aspects of the Laplacian on a graph embedded on a surface. The three main goals are to discuss: (1) for "circular" planar networks, the characterization due to Colin de Verdi\`ere of Dirichlet-to-Neumann operator; (2) The connections with the random spanning tree model; and (3) the characteristic polynomial of the L...
April 8, 1993
The functional determinant of an elliptic operator with positive, discrete spectrum may be defined as $e^{-Z'(0)}$, where $Z(s)$, the zeta function, is the sum $\sum_n^{\infty} \lambda_n^{-s}$ analytically continued to $s$ around the origin. In this paper $Z'(0)$ is calculated for the Laplace operator with Dirichlet boundary conditions inside polygons and simplices with the topology of a disc in the Euclidean plane. The domains we consider are hence piece--wise flat with corn...
September 5, 2012
We provide a simple characterization of the critical temperature for the Ising model on an arbitrary planar doubly periodic weighted graph. More precisely, the critical inverse temperature \beta for a graph G with coupling constants (J_e)_{e\in E(G)} is obtained as the unique solution of a linear equation in the variables (\tanh(\beta J_e))_{e\in E(G)}. This is achieved by studying the high-temperature expansion of the model using Kac-Ward matrices.
October 7, 2019
In this paper, we study the relation between the partition function of the free scalar field theory on hypercubes with boundary conditions and asymptotics of discrete partition functions on a sequence of "lattices" which approximate the hypercube as the mesh approaches to zero. More precisely, we show that the logarithm of the zeta regularized determinant of Laplacian on the hypercube with Dirichlet boundary condition appears as the constant term in the asymptotic expansion o...
October 12, 2011
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs, this height function is known to converge in the fine mesh limit to a Gaussian free field, following in particular Kenyon's work. In the present article, we study the asymptotics of smoothed and local field observables from the point of view...
December 19, 2008
We study a large class of critical two-dimensional Ising models namely critical Z-invariant Ising models on periodic graphs, example of which are the classical square, triangular and honeycomb lattice at the critical temperature. Fisher introduced a correspondence between the Ising model and the dimer model on a decorated graph, thus setting dimer techniques as a powerful tool for understanding the Ising model. In this paper, we give a full description of the dimer model corr...
September 11, 2020
The Laplacian matrix is of fundamental importance in the study of graphs, networks, random walks on lattices, and arithmetic of curves. In certain cases, the trace of its pseudoinverse appears as the only non-trivial term in computing some of the intrinsic graph invariants. Here we study a double sum $F_n$ which is associated with the trace of the pseudo inverse of the Laplacian matrix for certain graphs. We investigate the asymptotic behavior of this sum as $n \to \infty$. O...