IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v609y2023ics0378437122009037.html
   My bibliography  Save this article

On forest expansions for two-body partition functions on tree-like interaction graphs

Author

Listed:
  • Caravelli, F.

Abstract

We study tree approximations to classical two-body partition functions on sparse and loopy graphs via the Brydges–Kennedy–Abdessalam–Rivasseau forest expansion. We show that for sparse graphs (with large cycles), the partition function above a certain temperature T∗ can be approximated by a graph polynomial expansion over forests of the interaction graph. Within this region, we show that the approximation can be written in terms of a reference tree T on the interaction graph, with corrections due to cycles. From this point of view, this implies that high-temperature models are easy to solve on sparse graphs, as one can evaluate the partition function using belief propagation. We also show that there exist a high- and low-temperature regime, in which T can be obtained via a maximal spanning tree algorithm on a (given) weighted graph. We study the algebra of these corrections and provide first- and second-order approximation to the tree Ansatz, and give explicit examples for the first-order approximation.

Suggested Citation

  • Caravelli, F., 2023. "On forest expansions for two-body partition functions on tree-like interaction graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    • Handle: RePEc:eee:phsmap:v:609:y:2023:i:c:s0378437122009037
    DOI: 10.1016/j.physa.2022.128345
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437122009037
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2022.128345?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. M. Mézard & G. Parisi, 2001. "The Bethe lattice spin glass revisited," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 20(2), pages 217-233, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Barré, Julien & Gonçalves, Bruno, 2007. "Ensemble inequivalence in random graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 386(1), pages 212-218.
    2. Ostilli, M., 2024. "Exact results for the Ising model on a small-world network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 641(C).
    3. Sun, Yi-Fan & Sun, Zheng-Yang, 2019. "Target observation of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 517(C), pages 233-245.
    4. Robson, Dominic T. & Annibale, Alessia & Baas, Andreas C.W., 2022. "Reproducing size distributions of swarms of barchan dunes on Mars and Earth using a mean-field model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
    5. Pierre Paga & Reimer Kuhn, 2014. "Contagion in an interacting economy," Papers 1409.2625, arXiv.org, revised Mar 2015.
    6. Fabrizio Altarelli & Alfredo Braunstein & Luca Dall’Asta & Caterina De Bacco & Silvio Franz, 2015. "The Edge-Disjoint Path Problem on Random Graphs by Message-Passing," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-18, December.
    7. Yilun Shang, 2020. "Multi-Hop Generalized Core Percolation On Complex Networks," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 23(01), pages 1-15, March.
    8. Barucca, Paolo, 2020. "Spectral density of equitable core–periphery graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    9. Akın, Hasan, 2024. "Investigation of thermodynamic properties of mixed-spin (2, 1/2) Ising and Blum–Capel models on a Cayley tree," Chaos, Solitons & Fractals, Elsevier, vol. 184(C).
    10. Akın, Hasan, 2023. "The classification of disordered phases of mixed spin (2,1/2) Ising model and the chaoticity of the corresponding dynamical system," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:609:y:2023:i:c:s0378437122009037. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.