Resource allocation in sparse graphs

K. Y. Michael Wong, David Saad, Zhuo Gao

    Research output: Unpublished contribution to conferenceUnpublished Conference Paperpeer-review


    Resource allocation in sparsely connected networks, a representative problem of systems with real variables, is studied using the replica and Bethe approximation methods. An efficient distributed algorithm is devised on the basis of insights gained from the analysis and is examined using numerical simulations,showing excellent performance and full agreement with the theoretical results. The physical properties of the resource allocation model are discussed.
    Original languageEnglish
    Publication statusPublished - 14 Nov 2005
    EventEuropean Conference on Complex Systems, 2005 - Paris, France
    Duration: 1 Jan 20051 Jan 2005


    ConferenceEuropean Conference on Complex Systems, 2005

    Bibliographical note

    Licensed under a Creative Commons Attribution 2.5 License


    • Statistical physics
    • inference
    • message passing
    • resource allocation
    • sparse graphs


    Dive into the research topics of 'Resource allocation in sparse graphs'. Together they form a unique fingerprint.

    Cite this