We formulate a natural model of loops and isolated vertices for arbitrary planar graphs, which we call the monopole-dimer model. We show that the partition function of this model can be expressed as a determinant. We then extend the method of Kasteleyn and Temperley-Fisher to calculate the partition function exactly in the case of rectangular grids. This partition function turns out to be a square of a polynomial with positive integer coefficients when the grid lengths are even. Finally, we analyse this formula in the infinite volume limit and show that the local monopole density, free energy and entropy can be expressed in terms of well-known elliptic functions. Our technique is a novel determinantal formula for the partition function of a...
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic bou...
Abstract. The dimer model is the study of random dimer covers (perfect matchings) of a graph. A doub...
International audienceWe introduce the framework of discrete holomorphic functions on t-embeddings o...
We formulate a natural model of loops and isolated vertices for arbitrary planar graphs, which we ca...
We relate the planar random current representation introduced by Griffiths, Hurst and Sherman to the...
The Kac-Ward formula allows to compute the Ising partition function on a planar graph G with straigh...
International audienceWe introduce a general model of dimer coverings of certain plane bipartite gra...
We consider the monomer-dimer partition function on arbitrary finite planar graphs and arbitrary mon...
The U(1) Villain model is simulated in three and four dimensions. We locate monopoles using both the...
12 pages, 2 figuresInternational audienceIsoradial dimer models were introduced in \cite{Kenyon3} - ...
In this short note, we give a simple proof of a Lee-Yang type theorem which appeared in [SS14]. Give...
Abstract. We consider homogeneous factor models on uniformly sparse graph sequences converging local...
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum f...
72 pages, 21 figuresInternational audienceThe $Z$-invariant Ising model (Baxter in Philos Trans R So...
The Ising model is a classic model in statistical physics. Originally intended to model ferromagneti...
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic bou...
Abstract. The dimer model is the study of random dimer covers (perfect matchings) of a graph. A doub...
International audienceWe introduce the framework of discrete holomorphic functions on t-embeddings o...
We formulate a natural model of loops and isolated vertices for arbitrary planar graphs, which we ca...
We relate the planar random current representation introduced by Griffiths, Hurst and Sherman to the...
The Kac-Ward formula allows to compute the Ising partition function on a planar graph G with straigh...
International audienceWe introduce a general model of dimer coverings of certain plane bipartite gra...
We consider the monomer-dimer partition function on arbitrary finite planar graphs and arbitrary mon...
The U(1) Villain model is simulated in three and four dimensions. We locate monopoles using both the...
12 pages, 2 figuresInternational audienceIsoradial dimer models were introduced in \cite{Kenyon3} - ...
In this short note, we give a simple proof of a Lee-Yang type theorem which appeared in [SS14]. Give...
Abstract. We consider homogeneous factor models on uniformly sparse graph sequences converging local...
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum f...
72 pages, 21 figuresInternational audienceThe $Z$-invariant Ising model (Baxter in Philos Trans R So...
The Ising model is a classic model in statistical physics. Originally intended to model ferromagneti...
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic bou...
Abstract. The dimer model is the study of random dimer covers (perfect matchings) of a graph. A doub...
International audienceWe introduce the framework of discrete holomorphic functions on t-embeddings o...