Combinatorics and complexity of partition functions
From MaRDI portal
Publication:511202
DOI10.1007/978-3-319-51829-9zbMath1367.05002OpenAlexW2607730504MaRDI QIDQ511202
Publication date: 14 February 2017
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51829-9
Graph polynomials (05C31) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs, Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree, The complexity of approximating the complex-valued Potts model, Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction, Graph isomorphism and Gaussian boson sampling, Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs, Approximating real-rooted and stable polynomials, with combinatorial applications, Zero-freeness and approximation of real Boolean Holant problems, The Hafnian master theorem, Hafnian point processes and quasi-free states on the CCR algebra, An FPTAS for the hardcore model on random regular bipartite graphs, Probabilistic existence of regular combinatorial structures, Lee-Yang zeros of the antiferromagnetic Ising model, Zeros and approximations of holant polynomials on the complex plane, Algorithmic Pirogov-Sinai theory, Fast mixing via polymers for random graphs with unbounded degree, 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, The number of satisfying assignments of random 2‐SAT formulas, Correlation decay and the absence of zeros property of partition functions, Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \), Inapproximability of positive semidefinite permanents and quantum state tomography, Sequential importance sampling for estimating expectations over the space of perfect matchings, Approximating the chromatic polynomial is as hard as computing it exactly, Approximation Algorithms for the Random Field Ising Model, Unnamed Item, Angle-Restricted Sets and Zero-Free Regions for the Permanent, Independence polynomials and hypergeometric series, Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials, Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial, Analyticity for classical gasses via recursion, Large scale stochastic dynamics. Abstracts from the workshop held September 15--21, 2019, Lower bounds for contingency tables via Lorentzian polynomials, A remark on approximating permanents of positive definite matrices, The Ising partition function: zeros and deterministic approximation, Algorithms for #BIS-Hard Problems on Expander Graphs, Some applications of Wagner's weighted subgraph counting polynomial, Cayley trees do not determine the maximal zero-free locus of the independence polynomial, Orientations, lattice polytopes, and group arrangements. III: Cartesian product arrangements and applications to Tutte type polynomials, Permanental generating functions and sequential importance sampling, Counting independent sets in graphs with bounded bipartite pathwidth, Parameterized counting of partially injective homomorphisms, On a conjecture of Sokal concerning roots of the independence polynomial, Stability and complexity of mixed discriminants, Testing for Dense Subsets in a Graph via the Partition Function, Weighted counting of solutions to sparse systems of equations, Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems, Computing permanents of complex diagonally dominant matrices and tensors, More on zeros and approximation of the Ising partition function, Uniqueness of Gibbs measures for continuous hardcore models, Efficient algorithms for approximating quantum partition functions, Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model, Gauges, loops, and polynomials for partition functions of graphical models, The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs, Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs, Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
