An improved tree-graph bound
Mathematical Physics
2019-06-10 v1 math.MP
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.
Cite
@article{arxiv.1705.05353,
title = {An improved tree-graph bound},
author = {Daniel Ueltschi},
journal= {arXiv preprint arXiv:1705.05353},
year = {2019}
}
Comments
3 pages, 1 figure