Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Abstract: Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This equivalence provides a measure-preserving bijection between dimer coverings of a weighted bipartite planar graph and spanning trees on the corresponding Markov chain. The tilings correspond to harmonic functions on the Markov chain and to ``discrete analytic functions on the bipartite graph. The equivalence is extended to infinite periodic graphs, and we classify the resulting ``almost periodic tilings and harmonic functions.
Recommendations
Cites work
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- Basic properties of discrete analytic functions
- Conformal invariance of domino tiling.
- Height fluctuations in the honeycomb dimer model
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- The Laplacian and Dirac operators on critical planar graphs
- The dissection of rectangles into squares
- Tilings and discrete Dirichlet problems
- Trees and matchings
Cited in
(29)- The planar dimer model boundary: A survey
- Dimers and imaginary geometry
- The boundary of a square tiling of a graph coincides with the Poisson boundary
- Quadri-tilings of the plane
- Double-dimer pairings and skew Young diagrams
- Transfer matrix for spanning trees, webs and colored forests
- Dimers on rail yard graphs
- Local limits of lozenge tilings are stable under bounded boundary height perturbations
- The Dirichlet problem for orthodiagonal maps
- Combinatorics of tripartite boundary connections for trees and dimers
- Trees and matchings
- Dimers and circle patterns
- Boundary partitions in trees and dimers
- Free boundary dimers: random walk representation and scaling limit
- Site monotonicity and uniform positivity for interacting random walks and the spin \(O(N)\) model with arbitrary \(N\)
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Dimer model and holomorphic functions on t‐embeddings of planar graphs
- Dimer coverings of 1-slab cubic lattices
- An arctic circle theorem for groves
- Height fluctuations in the honeycomb dimer model
- On the asymptotics of dimers on tori
- Combinatorics of the double-dimer model
- scientific article; zbMATH DE number 1735896 (Why is no real title available?)
- Planar Dimer Tilings
- Families of convex tilings
- A bijection theorem for domino tilings with diagonal impurities
- How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?
- The multinomial tiling model
- scientific article; zbMATH DE number 1522755 (Why is no real title available?)
This page was built for publication: Dimers, tilings and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705883)
