Resource allocation in sparse graphs

Wong, K. Y. Michael, Saad, David and Gao, Zhuo (2005). Resource allocation in sparse graphs. IN: European Conference on Complex Systems, 2005. 2005-01-01 - 2005-01-01.

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.

Divisions: Engineering & Applied Sciences > Mathematics
Engineering & Applied Sciences > Systems analytics research institute (SARI)
Additional Information: Licensed under a Creative Commons Attribution 2.5 License http://creativecommons.org/licenses/by-sa/2.5/
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
Published Date: 2005-11-14
Authors: Wong, K. Y. Michael
Saad, David ( 0000-0001-9821-2623)
Gao, Zhuo

Download

[img]

Version: Accepted Version


Export / Share Citation


Statistics

Additional statistics for this record