Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
From MaRDI portal
Publication:3608304
Recommendations
- Statistical mechanics approach in the counting of integer partitions
- A general asymptotic scheme for the analysis of partition statistics
- Asymptotic density and the asymptotics of partition functions
- scientific article; zbMATH DE number 5057506
- Asymptotic analysis of random partitions
- Asymptotic distinction of counting processes
- Statistical mechanics of combinatorial partitions, and their limit shapes
- Asymptotic behaviour of the partition function
- Large deviations analysis for random combinatorial partitions with counter terms
- scientific article; zbMATH DE number 1880280
Cites work
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A random polynomial-time algorithm for approximating the volume of convex bodies
- A second threshold for the hard‐core model on a Bethe lattice
- A survey of max-type recursive distributional equations
- Approximating the Permanent
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Combinatorial criteria for uniqueness of Gibbs measures
- Countable state space Markov random fields and Markov chains on trees
- Counting and sampling \(H\)-colourings
- Counting independent sets up to the tree threshold
- Dynamics and endogeny for recursive processes on trees
- Gibbs measures and phase transitions
- scientific article; zbMATH DE number 3951995 (Why is no real title available?)
- scientific article; zbMATH DE number 1559584 (Why is no real title available?)
- scientific article; zbMATH DE number 1787232 (Why is no real title available?)
- scientific article; zbMATH DE number 2151248 (Why is no real title available?)
- scientific article; zbMATH DE number 2151257 (Why is no real title available?)
- Information flow on trees
- Invariant probability measures and dynamics of exponential linear type maps
- Linear phase transition in random linear constraint satisfaction problems
- Markov random fields on an infinite tree
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- Prescribing a System of Random Variables by Conditional Distributions
- Randomly coloring constant degree graphs
- The complexity of computing the permanent
- Uniqueness of uniform random colorings of regular trees
Cited in
(40)- Total variation discrepancy of deterministic random walks for ergodic Markov chains
- Charting the replica symmetric phase
- Gibbs measures over locally tree-like graphs and percolative entropy over infinite regular trees
- Approximating partition functions of the two-state spin system
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
- Evaluations of Tutte polynomials of regular graphs
- Dismantlability, connectedness, and mixing in relational structures
- Uniqueness of Gibbs measures for continuous hardcore models
- Spatial mixing and the connective constant: optimal bounds
- Factor models on locally tree-like graphs
- Random cluster model on regular graphs
- Weighted enumeration of spanning subgraphs in locally tree-like graphs
- Harnessing the Bethe free energy
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
- Correlation decay and deterministic FPTAS for counting colorings of a graph
- Replica symmetry of the minimum matching
- Extremal regular graphs: independent sets and graph homomorphisms
- Computing the partition function of a polynomial on the Boolean cube
- Sequential cavity method for computing limits of the log-partition function for lattice models
- Left and right convergence of graphs with bounded degree
- The replica symmetric phase of random constraint satisfaction problems
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Dismantlability, Connectedness, and Mixing in Relational Structures
- Fisher zeros and correlation decay in the Ising model
- Counting hypergraph colorings in the local lemma regime
- Strong spatial mixing of list coloring of graphs
- Strong spatial mixing in homomorphism spaces
- Endogeny for the logistic recursive distributional equation
- Approximate counting via correlation decay in spin systems
- Correlation decay and the absence of zeros property of partition functions
- Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems
- The mean field traveling salesman and related problems
- Online Edge Coloring via Tree Recurrences and Correlation Decay
- Deterministically approximating the volume of a Kostka polytope
- Deterministic approximate counting of colorings with fewer than 2 colors via absence of zeros
- Correlation decay and partition function zeros: algorithms and phase transitions
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution
- Approximating the partition function of planar two-state spin systems
- 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
This page was built for publication: Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608304)
