Message Passing for Task Redistribution on Sparse Graphs
Abstract
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.
Cite
Text
Wong et al. "Message Passing for Task Redistribution on Sparse Graphs." Neural Information Processing Systems, 2005.Markdown
[Wong et al. "Message Passing for Task Redistribution on Sparse Graphs." Neural Information Processing Systems, 2005.](https://mlanthology.org/neurips/2005/wong2005neurips-message/)BibTeX
@inproceedings{wong2005neurips-message,
title = {{Message Passing for Task Redistribution on Sparse Graphs}},
author = {Wong, K. Y. Michael and Saad, David and Gao, Zhuo},
booktitle = {Neural Information Processing Systems},
year = {2005},
pages = {1529-1536},
url = {https://mlanthology.org/neurips/2005/wong2005neurips-message/}
}