Resource allocation in sparse graphs

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

Research output: Contribution to conferencePaper

Abstract

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

Conference

ConferenceEuropean Conference on Complex Systems, 2005
CountryFrance
CityParis
Period1/01/051/01/05

Bibliographical note

Licensed under a Creative Commons Attribution 2.5 License http://creativecommons.org/licenses/by-sa/2.5/

Keywords

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

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

  • Cite this

    Wong, K. Y. M., Saad, D., & Gao, Z. (2005). Resource allocation in sparse graphs. Paper presented at European Conference on Complex Systems, 2005, Paris, France.