English
Related papers

Related papers: Height representation of XOR-Ising loops via bipar…

200 papers

We find by simulation that the interfaces in the exclusive-or (XOR) of two independent 2D Ising spin configurations at the critical temperature form an ensemble of loops that have the same distribution as the contour lines of the Gaussian…

Statistical Mechanics · Physics 2011-02-21 David B. Wilson

We consider dimer models on graphs which are bipartite, periodic and satisfy a geometric condition called {\em isoradiality}, defined in \cite{Kenyon3}. We show that the scaling limit of the height function of any such dimer model is…

Probability · Mathematics 2015-06-26 B. de Tilière

This is the second paper in the series devoted to the study of the dimer model on t-embeddings of planar bipartite graphs. We introduce the notion of perfect t-embeddings and assume that the graphs of the associated origami maps converge to…

Probability · Mathematics 2021-09-15 Dmitry Chelkak , Benoît Laslier , Marianna Russkikh

An isoradial graph is a planar graph in which each face is inscribable into a circle of common radius. We study the 2-dimensional perfect matchings on a bipartite isoradial graph, obtained from the union of an isoradial graph and its…

Probability · Mathematics 2020-05-12 Zhongyang Li

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…

Probability · Mathematics 2023-04-04 Zhongyang Li

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…

Probability · Mathematics 2015-05-27 Sunil Chhita

The purpose of this note is to give a succinct summary of some basic properties of T-graphs which arise in the study of the dimer model. We focus in particular on the relation between the dimer model on the heaxgonal lattice with a given…

Probability · Mathematics 2016-10-26 Nathanaël Berestycki , Benoit Laslier , Gourab Ray

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,…

Probability · Mathematics 2014-07-24 Julien Dubédat

We present exact combinatorial versions of bosonization identities, which equate the product of two Ising correlators with a free field (bosonic) correlator. The role of the discrete free field is played by the height function of an…

Probability · Mathematics 2012-03-31 Julien Dubédat

We use the periodic Schur process, introduced in arXiv:math/0601019v1, to study the random height function of lozenge tilings (equivalently, dimers) on an infinite cylinder distributed under two variants of the $q^{\operatorname{vol}}$…

Probability · Mathematics 2022-09-28 Andrew Ahn , Marianna Russkikh , Roger Van Peski

The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the…

Statistical Mechanics · Physics 2023-10-10 Zhiyi Li , ZongZheng Zhou , Sheng Fang , Youjin Deng

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…

Probability · Mathematics 2022-09-05 Zhongyang Li , Mirjana Vuletić

We present a general result which shows that the winding of the branches in a uniform spanning tree on a planar graph converge in the limit of fine mesh size to a Gaussian free field. The result holds true assuming only convergence of…

Probability · Mathematics 2018-11-28 Nathanaël Berestycki , Benoit Laslier , Gourab Ray

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…

Probability · Mathematics 2022-11-08 Dmitry Chelkak , Benoît Laslier , Marianna Russkikh

We relate the planar random current representation introduced by Griffiths, Hurst and Sherman to the dimer model. More precisely, we provide a measure-preserving map between double random currents (obtained as the sum of two independent…

Mathematical Physics · Physics 2019-03-21 Hugo Duminil-Copin , Marcin Lis

We rigorously establish the asymptotic equivalence between the height function of interacting dimers on the square lattice and the massless Gaussian free field. Our theorem explains the microscopic origin of the sine-Gordon field theory…

Statistical Mechanics · Physics 2015-06-23 Alessandro Giuliani , Vieri Mastropietro , Fabio Lucio Toninelli

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,…

Probability · Mathematics 2026-01-12 Marcin Lis , Lucas Rey , Kieran Ryan

In this paper we investigate the height field of a dimer model/random domino tiling on the plane at a smooth-rough (i.e. gas-liquid) transition. We prove that the height field at this transition has two-point correlation functions which…

Mathematical Physics · Physics 2023-01-31 Scott Mason

Given a bounded Riemann surface $M$ of finite topological type, we show the existence of a universal and conformally invariant scaling limit for the Temperleyan cycle-rooted spanning forest on any sequence of graphs which approximate $M$ in…

Probability · Mathematics 2024-12-11 Nathanaël Berestycki , Benoit Laslier , Gourab Ray

We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square grid or a row of a hexagonal lattice. We assign the graph…

Probability · Mathematics 2020-09-01 Cédric Boutillier , Zhongyang Li
‹ Prev 1 2 3 10 Next ›