An improved tree-graph bound
Daniel Ueltschi
TL;DR
This paper presents an improved bound for the cluster expansion in statistical physics, utilizing Kruskal's algorithm to simplify the proof and enhance the theoretical understanding of the bound.
Contribution
It introduces a streamlined proof of the improved cluster expansion bound by leveraging Kruskal's algorithm, building on recent advances in the field.
Findings
Simplified proof of the improved cluster expansion bound
Enhanced understanding of the bound's relevance in statistical physics
Application of Kruskal's algorithm to cluster expansion analysis
Abstract
This report discusses the improved bound of the cluster expansion, recently proposed by Procacci and Yuhjtman (Lett. Math. Phys. 107, 31, 2017). Brydges and Helmuth noticed the relevance of Kruskal's algorithm, which allows to streamline and simplify the argument. These clarifications have proved useful in arXiv:1705.04385.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Computational Drug Discovery Methods · Machine Learning in Materials Science