scientific article; zbMATH DE number 5485444
From MaRDI portal
Publication:3549606
Cited in
(41)- On counting 3-D matchings of size \(k\)
- Sequential cavity method for computing free energy and surface pressure
- Counting hypergraph matchings up to uniqueness threshold
- Zero-free regions of partition functions with applications to algorithms and graph limits
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
- A faster FPTAS for counting two-rowed contingency tables
- On a conjecture of Sokal concerning roots of the independence polynomial
- Uniqueness of Gibbs measures for continuous hardcore models
- Spatial mixing and the connective constant: optimal bounds
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- Matchings in Benjamini-Schramm convergent graph sequences
- Weighted enumeration of spanning subgraphs in locally tree-like graphs
- Hafnians, perfect matchings and Gaussian matrices
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
- Correlation decay and deterministic FPTAS for counting colorings of a graph
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Approximating permanents and hafnians
- A faster FPTAS for \#Knapsack
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- scientific article; zbMATH DE number 7559110 (Why is no real title available?)
- The complexity of approximating the matching polynomial in the complex plane
- Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing
- Approximating real-rooted and stable polynomials, with combinatorial applications
- Fermions and loops on graphs. II: A monomer-dimer model as a series of determinants
- Approximate counting via correlation decay in spin systems
- Dynamic Sampling from Graphical Models
- Absence of zeros implies strong spatial mixing
- Smoothed counting of 0–1 points in polyhedra
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Perfect sampling from spatial mixing
- Counting independent sets in graphs with bounded bipartite pathwidth
- Sequential importance sampling for estimating expectations over the space of perfect matchings
- Approximation Algorithms for the Random Field Ising Model
- Correlation decay and partition function zeros: algorithms and phase transitions
- Toward derandomizing Markov chain Monte Carlo
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
- Sink-free orientations: a local sampler with applications
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
- Computing the partition function for graph homomorphisms with multiplicities
- Approximating the volume of unions and intersections of high-dimensional geometric objects
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549606)
