Journal article
Tight bounds on the coefficients of partition functions via stability
- Abstract:
-
Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model and monomer-dimer model are the independence and matching polynomials respectively.
We show how stability results follow naturally from the recently developed occupancy method for maximizing and minimizing physical observables over classes of regula...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 510.5KB)
-
- Publisher copy:
- 10.1016/j.jcta.2018.06.005
Authors
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Journal of Combinatorial Theory, Series A Journal website
- Volume:
- 160
- Pages:
- 1-30
- Publication date:
- 2018-06-19
- Acceptance date:
- 2018-06-12
- DOI:
- EISSN:
-
1096-0899
- ISSN:
-
0097-3165
- Source identifiers:
-
860163
Item Description
- Keywords:
- Pubs id:
-
pubs:860163
- UUID:
-
uuid:c71ba9a3-c050-4f75-b671-e8f56e83928c
- Local pid:
- pubs:860163
- Deposit date:
- 2018-08-29
Terms of use
- Copyright holder:
- Elsevier
- Copyright date:
- 2018
- Notes:
- © 2018 Elsevier Inc. This is the accepted manuscript version of the article. The final version is available online from Elsevier at: https://doi.org/10.1016/j.jcta.2018.06.005
If you are the owner of this record, you can report an update to it here: Report update to this record