An improved tree-graph bound

@inproceedings{Ueltschi2017AnIT,
  title={An improved tree-graph bound},
  author={D. Ueltschi},
  year={2017}
}
  • D. Ueltschi
  • Published 2017
  • Physics, Mathematics
  • The day before my talk, Aldo Procacci told us about the beautiful new bound for the convergence of the cluster expansion, which he obtained recently with S. Yuhjtman [5]. This suggested a way to improve the tree-graph bounds stated in [3]. Additional comments by David Brydges and Tyler Helmuth during Procacci’s talk were illuminating; they noticed in particular the relevance of Kruskal’s algorithm. The goals of my talk were to turn the result of [5] as an explicit tree-graph bound, and to… CONTINUE READING

    Figures from this paper.

    Well-Posedness of the Iterative Boltzmann Inversion
    5
    Hanke Well-posedness of the Iterative Boltzmann Inversion

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES
    Translated into Dutch.) New patterns in genetics and development
    • 1962
    Erratum and Addendum: “Abstract Polymer Models with General Pair Interactions”
    8
    Abstract cluster expansion with applications to statistical mechanical systems
    42
    Yuhjtman, Convergence of Mayer and virial expansions and the Penrose tree-graph
    • 2017
    Fréchet differentiability of molecular distribution functions II: the Ursell function
    6
    Federbush, A new form of the Mayer expansion in classical statistical mechanics
    • 1978