Central limit theorems, Lee-Yang zeros, and graph-counting polynomials

DOI10.1016/j.jcta.2016.02.009zbMath1334.05065arXiv1408.4153OpenAlexW2963977496MaRDI QIDQ272330

Joel L. Lebowitz, Eugene R. Speer, Boris G. Pittel, David Pierre Ruelle

Publication date: 20 April 2016

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.4153

zbMATH Keywords

asymptotic enumerationlimit theoremscombinatorialgrand canonical partition functiongraph polynomialLee-Yang

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Asymptotic enumeration (05A16)

Related Items

Indirect acquisition of information in quantum mechanics ⋮ Variations of central limit theorems and Stirling numbers of the first kind ⋮ Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs ⋮ The method of cumulants for the normal approximation ⋮ Graph-counting polynomials for oriented graphs ⋮ The topology and geometry of random square-tiled surfaces ⋮ Limit theorems for monomer-dimer mean-field models with attractive potential ⋮ Edgeworth expansions for independent bounded integer valued random variables ⋮ Stability in the Marcinkiewicz theorem ⋮ Absence of zeros implies strong spatial mixing ⋮ Disordered monomer-dimer model on cylinder graphs ⋮ On a surface formed by randomly gluing together polygonal discs ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ Mean-Field Monomer-Dimer Models. A Review ⋮ Fluctuations, large deviations and rigidity in hyperuniform systems: a brief survey ⋮ Number rigidity in superhomogeneous random point fields ⋮ Asymptotic normality of Laplacian coefficients of graphs ⋮ A characterization of polynomials whose high powers have non-negative coefficients ⋮ The asymptotic normality of \((s,s+1)\)-cores with distinct parts ⋮ Asymptotic normality of associated Lah numbers ⋮ Central limit theorems from the roots of probability generating functions ⋮ The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs ⋮ Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local central limit theorem for determinantal point processes
• Gibbs measures and phase transitions.
• Phase transitions with four-spin interactions
• General combinatorial schemas: Gaussian limit distributions and exponential tails
• Geometric analysis of \(\phi^ 4\) fields and Ising models. I, II
• The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
• Characterization of Lee-Yang polynomials
• Weighted enumeration of spanning subgraphs with degree constraints
• Application of the Berry-Esseen inequality to combinatorial estimates
• The central limit theorem and the problem of equivalence of ensembles
• Counting unbranched subgraphs
• Probabilistic bounds on the coefficients of polynomials with only real zeros
• Matching behaviour is asymptotically normal
• Theory of monomer-dimer systems
• Central and local limit theorems applied to asymptotic enumeration
• Location of the Lee-Yang zeros and absence of phase transitions in some Ising spin systems
• Theorems on the Partition Functions of the Heisenberg Ferromagnets
• The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
• Stirling Behavior is Asymptotically Normal
• On the Convolution of Logarithmically Concave Sequences
• Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
• Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
• A normal law for matchings