Resource allocation in sparse graphs


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.

Divisions: College of Engineering & Physical Sciences > Systems analytics research institute (SARI)
Additional Information: Licensed under a Creative Commons Attribution 2.5 License
Event Title: European Conference on Complex Systems, 2005
Event Type: Other
Event Dates: 2005-01-01 - 2005-01-01
Uncontrolled Keywords: Statistical physics,inference,message passing,resource allocation,sparse graphs
Last Modified: 27 Dec 2023 10:12
Date Deposited: 04 Aug 2009 11:03
PURE Output Type: Paper
Published Date: 2005-11-14
Authors: Wong, K. Y. Michael
Saad, David (ORCID Profile 0000-0001-9821-2623)
Gao, Zhuo



Version: Accepted Version

Export / Share Citation


Additional statistics for this record