Related papers: Limit shapes for the dimer model
We introduce a simplified model of planar first passage percolation where weights along vertical edges are deterministic. We show that the limit shape has a flat edge in the vertical direction if and only if the random distribution of the…
This paper is aimed at extending the graph limit with time dependent weights obtained in [1] for the case of a pairwise competition model introduced in [10], in which the equation governing the weights involves a weak singularity at the…
We consider the monomer-dimer model on weighted graphs embedded in surfaces with boundary, with the restriction that only monomers located on the boundary are allowed. We give a Pfaffian formula for the corresponding partition function,…
We study a model of colored multiwebs, which generalizes the dimer model to allow each vertex to be adjacent to \(n_v\) edges. These objects can be formulated as a random tiling of a graph with partial dimer covers. We examine the case of a…
We discuss how to construct limit shapes for the domino tiling model (square lattice dimer model) and $5$-vertex model, in appropriate polygonal domains. Our methods are based on the harmonic extension method of [R. Kenyon and I. Prause,…
We show that the dimer model on a bipartite graph on a torus gives rise to a quantum integrable system of special type - a cluster integrable system. The phase space of the classical system contains, as an open dense subset, the moduli…
We study asymptotics of the dimer model on large toric graphs. Let $\mathbb L$ be a weighted $\mathbb{Z}^2$-periodic planar graph, and let $\mathbb{Z}^2 E$ be a large-index sublattice of $\mathbb{Z}^2$. For $\mathbb L$ bipartite we show…
We prove a distributional limit theorem conjectured in [Journal of Statistical Physics 174, No. 6, 1372-1403 (2019)] for partition functions defining models of directed polymers on diamond hierarchical graphs with disorder variables placed…
We investigate the possibility of proving upper bounds on Hadwiger's number of a graph with partial information, mirroring several known upper bounds for the chromatic number. For each such bound we determine whether the corresponding bound…
We investigate the multiplicity of solutions for a generalized poly-Laplacian system on weighted finite graphs and a generalized poly-Laplacian system with Dirichlet boundary value on weighted locally finite graphs, respectively, via the…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture…
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain $K_{3,3}$ as a bipartite minor. Similarly, we provide a forbidden minor…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…
This paper provides a comprehensive study of the dimer model on infinite minimal graphs with Fock's elliptic weights [arXiv:1503.00289]. Specific instances of such models were studied in [arXiv:052711, arXiv:1612.09082, arXiv1801.00207]; we…
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve…
The concept of metric dimension has applications in a variety of fields, such as chemistry, robotic navigation, and combinatorial optimization. We show bounds for graphs with $n$ vertices and metric dimension $\beta$. For Hamiltonian…
In this paper we prove the convergence of solutions to discrete models for binary waveguide arrays toward those of their formal continuum limit, for which we also show the existence of localized standing waves. This work rigorously…
Let B_{2t} be a bipartite planar graph with an even number of regions. We are able to find bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to the graph. We also will investigate the minimal…
A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors…