Approximating the number of monomer-dimer coverings of a lattice.
type: Item
instance of: scholarly article
title: Approximating the number of monomer-dimer coverings of a lattice.
zbMATH Open document ID: 1081.82523
DOI: 10.1007/BF02183743
author: Dana Randall
author: Alistair Sinclair
author: Claire Kenyon
published in: Journal of Statistical Physics
publication date: 2001-01-16T00:00:00Z
Mathematics Subject Classification ID: 82B20
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 82B41
zbMATH DE Number: 1554072
zbMATH Keywords: monomer-dimer problem
zbMATH Keywords: dimer coverings
zbMATH Keywords: lattice statistics
zbMATH Keywords: Monte Carlo methods
zbMATH Keywords: relaxation time
zbMATH Keywords: mixing time
zbMATH Keywords: approximation algorithm
zbMATH Keywords: Fisher-Kasteleyn-Temperley algorithm
zbMATH Keywords: perfect matching
zbMATH Keywords: monomer-dimer correlations
zbMATH Keywords: vertex-transitive graphs
MaRDI profile type: Publication
cites work: A cell-cluster theory for the liquid state. II
cites work: Statistical Mechanics of Dimers on a Plane Lattice
cites work: Statistical Mechanics of Dimers on a Plane Lattice. II. Dimer Correlations and Monomers
cites work: Q4198056
cites work: Statistical mechanics of regular mixtures
cites work: Q5537646
cites work: Negative Finding for the Three-Dimensional Dimer Problem
cites work: A Lower Bound for the Monomer-Dimer Problem
cites work: Theory of monomer-dimer systems
cites work: Q4234141
cites work: Approximating the Permanent
cites work: Polynomial-Time Approximation Algorithms for the Ising Model
cites work: Q4230355
cites work: A Monte-Carlo Algorithm for Estimating the Permanent
cites work: Monte-Carlo approximation algorithms for enumeration problems
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: Q5605168
cites work: Matchings in lattice graphs
cites work: On defect-d matchings in graphs
cites work: Q4763400
cites work: Approximating the permanent: A simple approach
cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
cites work: Q3135094
cites work: Dimer problem in statistical mechanics-an exact result
cites work: The complexity of computing the permanent
cites work: Antiferromagnetism. The Triangular Ising Net
cites work: Q3972641
description: scientific article; zbMATH DE number 1554072