Related papers: Dimers and Imaginary geometry
The XOR-Ising model on a graph consists of random spin configurations on vertices of the graph obtained by taking the product at each vertex of the spins of two independent Ising models. In this paper, we explicitly relate loop…
We consider the dimer model on a bipartite graph embedded into a locally flat Riemann surface with conical singularities and satisfying certain geometric conditions in the spirit of the work of [Chelkak, Laslier and Russkikh, Proceedings of…
We study the dimer model on subgraphs of the square lattice in which vertices on a prescribed part of the boundary (the free boundary) are possibly unmatched. Each such unmatched vertex is called a monomer and contributes a fixed…
We consider the dimer model on the square and hexagonal lattices with doubly periodic weights. The purpose of this paper is threefold: (a) we establish a rigourous connection with the massive SLE$_2$ constructed by Makarov and Smirnov (and…
We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube…
We study perfect matchings on the square-hexagon lattice with $1\times n$ periodic edge weights such that the boundary condition is given by either (1) each remaining vertex on the bottom boundary is followed by $(m-1)$ removed vertices;…
This paper establishes a universality result for scaling limits of uniformly random lozenge tilings of large domains. We prove that whenever a boundary of the domain has three adjacent straight segments inclined under 120 degrees to each…
We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on $n$ vertices with minimal degree linear in $n$ is typically of order $\sqrt{n}$. A byproduct of our proof, which is of independent interest, is that…
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…
It has been well known for a long time that the height function of random lozenge tilings of large domains follow a law of large number and possible limits called dimer limit shapes are well understood. For the next order, it is expected…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
We introduce the framework of discrete holomorphic functions on t-embeddings of weighted bipartite planar graphs; t-embeddings also appeared under the name Coulomb gauges in a recent paper arXiv:1810.05616. We argue that this framework is…
We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm. We provide a quantitative form of this result, calculating the…
We consider dense graph sequences that converge to a connected graphon and prove that the GHP scaling limit of their uniform spanning trees is Aldous' Brownian CRT. Furthermore, we are able to extract the precise scaling constant from the…
We consider the disordered monomer-dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the…
We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…
The dimer model on a planar bipartite graph can be viewed as a random surface measure. We study these fluctuations for a dimer model on the square grid with two different classes of weights and provide a condition for their equivalence. In…
We study various mathematical aspects of discrete models on graphs, specifically the Dimer and the Ising models. We focus on proving gluing formulas for individual summands of the partition function. We also obtain partial results regarding…
We study crossing numbers of dense graph drawings whose vertices are uniformly distributed either on the unit sphere or in a compact convex planar domain. We prove a sharp inequality for weighted geodesic drawings on $\mathbb S^2$ in a…
We consider two different versions of the double dimer model on a planar domain, where we either fold a single dimer cover on a symmetric domain onto itself across the line of symmetry, or we superimpose two independent dimer covers on two,…