An introduction to the dimer model

By Richard Kenyon. 2003

191 citations recorded by the source corpus.

A perfect matching of a graph is a subset of edges which covers every vertex exactly once, that is, for every vertex there is exactly one edge in the set with that vertex as endpoint. The dimer model is the study of the set of perfect matchings of a (possibly infinite) graph. The most well-known example is when the graph is Z, for which perfect matchings are equivalent (via a simple duality) to domino tilings, that is, tilings of the plane with 2× 1 and 1× 2 rectangles. In the first three sections we study domino tilings of the plane and of finite polygonal regions, or equivalently, perfect matchings on Z and subgraphs of Z. In the last two sections we study the FK-percolation model and the dimer model on a more general family of planar graphs.

Subfields: Condensed Matter Physics, Mathematical Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/7c66ff59834233f8ea7857e4e0b249f1a7c98f87

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Condensed Matter Physics

  1. Kristian D. Kennaway
  2. A. Hanany
  3. Scott Sheffield
  4. M. Yamazaki
  5. Raf Bocklandt
  6. A. Okounkov
  7. C. Vafa
  8. Richard Kenyon

In Mathematical Physics

  1. A. Hanany
  2. C. Vafa
  3. Kristian D. Kennaway
  4. A. Okounkov
  5. M. Yamazaki
  6. Raf Bocklandt
  7. Scott Sheffield
  8. Yang-Hui He

In Statistics and Probability

  1. Scott Sheffield
  2. A. Okounkov
  3. M. Yamazaki
  4. Raf Bocklandt
  5. C. Vafa
  6. Kristian D. Kennaway
  7. A. Hanany
  8. Richard Kenyon

Citations in the corpus