Message passing for task redistribution on sparse graphs

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

Research output: Unpublished contribution to conferenceUnpublished Conference Paperpeer-review


The problem of resource allocation in sparse graphs with real variables is studied using methods of statistical physics. An efficient distributed algorithm is devised on the basis of insight gained from the analysis and is examined using numerical simulations, showing excellent performance and full agreement with the theoretical results.
Original languageEnglish
Number of pages8
Publication statusPublished - 23 Oct 2006
EventNeural Information Processing Systems 18 -
Duration: 23 Oct 200623 Oct 2006


ConferenceNeural Information Processing Systems 18


  • problem of resource allocation
  • sparse graphs with real variables
  • optimal resource allocation


Dive into the research topics of 'Message passing for task redistribution on sparse graphs'. Together they form a unique fingerprint.

Cite this