Counting hypergraph matchings up to uniqueness threshold
type: Item
instance of: scholarly article
title: Counting hypergraph matchings up to uniqueness threshold
zbMATH Open document ID: 1423.05084
author: Renjie Song
author: Yitong Yin
author: Jinman Zhao
published in: Information and Computation
publication date: 2019-05-02T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7050006
zbMATH Keywords: approximate counting
zbMATH Keywords: Gibbs measure
zbMATH Keywords: correlation decay
zbMATH Keywords: hypergraph matchings
zbMATH Keywords: uniqueness threshold
MaRDI profile type: Publication
full work available at URL: j.ic.2019.02.001
OpenAlex ID: W2962913771
cites work: Q3549606
cites work: Q4598184
cites work: Path coupling using stopping times and counting independent sets and colorings in hypergraphs
cites work: Ising models on locally tree-like graphs
cites work: Approximate Counting of Matchings in (3,3)-Hypergraphs
cites work: Counting and sampling \(H\)-colourings
cites work: Improved inapproximability results for counting independent sets in the hard-core model
cites work: The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs
cites work: Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
cites work: Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
cites work: Correlation decay and deterministic FPTAS for counting colorings of a graph
cites work: Strong spatial mixing of list coloring of graphs
cites work: Theory of monomer-dimer systems
cites work: Q4519896
cites work: Approximating the Permanent
cites work: Approximate Counting of Matchings in Sparse Uniform Hypergraphs
cites work: Q3721805
cites work: Approximate Counting via Correlation Decay in Spin Systems
cites work: Correlation Decay up to Uniqueness in Spin Systems
cites work: A Simple FPTAS for Counting Edge Covers
cites work: FPTAS for Counting Monotone CNF
cites work: FPTAS for Weighted Fibonacci Gates and Its Applications
cites work: FPTAS for Hardcore and Ising Models on Hypergraphs
cites work: Improved FPTAS for Multi-spin Systems
cites work: On the hardness of sampling independent sets beyond the tree threshold
cites work: Improved mixing condition on the grid for counting and sampling independent sets
cites work: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
cites work: Spatial mixing and the connective constant: optimal bounds
cites work: Counting in two-spin models on \(d\)-regular graphs
cites work: Markov random fields on an infinite tree
cites work: Combinatorial criteria for uniqueness of Gibbs measures
cites work: Counting independent sets up to the tree threshold
DOI: 10.1016/J.IC.2019.02.001
description: scientific article; zbMATH DE number 7050006