Related papers: Limit shapes for the dimer model
In this article we study the double dimer model on hyperbolic Temperleyan graphs via circle packings. We prove that on such graphs, the weak limit of the dimer model exists if and only if the removed black vertex from the boundary of the…
The classical dimer model is concerned with the (weighted) enumeration of perfect matchings of a graph. An $n$-dimer cover is a multiset of edges that can be realized as the disjoint union of $n$ individual matchings. For a probability…
In this paper we are concerned with the existence of invariant curves of planar twist mappings which are almost periodic in a spatial variable. As an application of this result to differential equations we will discuss the existence of…
The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…
In this paper, we consider a biharmonic equation with respect to the Dirichlet problem on a domain of a locally finite graph. Using the variation method, we prove that the equation has two distinct solutions under certain conditions.
Rail-yard graphs are a general class of graphs introduced in \cite{bbccr} on which the random dimer coverings form Schur processes. We study asymptotic limits of random dimer coverings on rail yard graphs with free boundary conditions on…
The bead model is a random point field on $\mathbb{Z}\times\mathbb{R}$ which can be viewed as a scaling limit of dimer model. We prove that, in the scaling limit, the normalized height function of a uniformly chosen random bead…
We establish via variational methods the existence of a standing wave together with an estimate on the convergence to its asymptotic states for a bistable system of partial differential equations on a periodic domain. The main tool is a…
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…
We study the finite-size corrections of the dimer model on $\infty \times N$ square lattice with two different boundary conditions: free and periodic. We find that the finite-size corrections depend in a crucial way on the parity of $N$,…
In a previous paper, we showed how certain orientations of the edges of a graph G embedded in a closed oriented surface S can be understood as discrete spin structures on S. We then used this correspondence to give a geometric proof of the…
A key question in the analysis of discrete models for material defects, such as vortices in spin systems and superconductors or isolated dislocations in metals, is whether information on boundary energy for a domain can be sufficient for…
We investigate nonlinear Dirac equations on a periodic quantum graph $G$ and develop a variational approach to the existence and multiplicity of bound states. After introducing the Dirac operator on $G$ with a $\mathbb Z^{d}$-periodic…
By means of variational methods, in this paper, we establish sharp existence results for solutions of the master equations governing `fractional multiple vortices.' In the doubly periodic situation, the conditions for existence are both…
We study the 19-vertex model of Statistical Mechanics in a square with the domain wall boundary condition. Using the minimal set of generating flip actions we build a parametrized dynamic version of the model. For all observed dynamic…
We study asymptotic limit of random pure dimer coverings on rail yardgraphs when the mesh sizes of the graphs go to 0. Each pure dimer covering correspondsto a sequence of interlacing partitions starting with an empty partition and ending…
The question of what conditions should be set at the nodes of a discrete graph for the wave equation with discrete time is investigated. The variational method for the derivation of these conditions is used. A parallel with the continuous…
We prove that the Davenport-Mahler bound holds for arbitrary graphs with vertices on the set of roots of a given univariate polynomial with complex coefficients.
This paper mathematically studies membranes and filaments adhering to periodic patterned substrates in a one-dimensional model. The problem is formulated by the minimizing problem of an elastic energy with a contact potential on graph…
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.