Consensus propagation

IEEE Transactions on Information Theory

Volumn 52, Issue 11, 2006, Pages 4753-4766

  Moallemi, Ciamac C ^a   Van Roy, Benjamin ^a  

^a Stanford University ^*  (United States)

Author keywords

Belief propagation; Distributed averaging; Distributed consensus; Distributed signal processing; Gaussian Markov random fields; Max product algorithm; Message passing algorithms; Min sum algorithm; Sum product algorithm

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; NETWORK PROTOCOLS; SIGNAL PROCESSING;

BELIEF PROPAGATION; CONSENSUS PROPAGATION; DISTRIBUTED AVERAGING; DISTRIBUTED CONSENSUS; DISTRIBUTED SIGNAL PROCESSING; GAUSSIAN MARKOV RANDOM FIELDS; MAX-PRODUCT ALGORITHM; MESSAGE-PASSING ALGORITHM; MIN-SUM ALGORITHM; SUM-PRODUCT ALGORITHM;

INFORMATION THEORY;

EID: 33750584366     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.883539     Document Type: Article

References (38)

1. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," in Proc. ACM/IEEE In. Confe. Mobile Computing and Networking, Boston, MA, Aug. 2000, pp. 56-67.
2. S. R. Madden, M. J. Franklin, J. Hellerstein, and W. Hong, "Tag: A tiny aggregation service for ad hoc sensor networks," in Proc. USENIX Symp. Operating Systems Design and Implementation, Boston, MA, Dec. 2002, pp. 131-146.
3. S. R. Madden, R. Szewczyk, M. J. Franklin, and D. Culler, "Supporting aggregate queries over ad-hoc wireless sensor networks," in Proc. Workshop on Mobile Computing Systems and Applications, Callicoon, NY, Jun. 2002, pp. 49-58.
4. J. Zhao, R. Govindan, and D. Estrin, "Computing aggregates for monitoring wireless sensor networks," in Proc. Int. Workshop on Sensor Net Protocols and Applications, Anchorage, AK, May 2003, pp. 139-148.
5. M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani, Estimating Aggregates on a Peer-to-Peer Network, Stanford Univ. Database Group, Stanford, CA, 2003, Tech. Rep.
6. M. Jelasity and A. Montresor, "Epidemic-style proactive aggregation in large overlay networks," in Proc. 24th Int. Conf. Distributed Computing, Tokyo, Japan, Mar. 2004, pp. 102-109.
7. A. Montresor, M. Jelasity, and O. Babaoglu, "Robust aggregation protocols for large-scale overlay networks," in Proc. Int. Conf. Dependable Systems and Networks, Florence, Italy, Jun. 2004, pp. 19-28.
8. L. Xiao, S. Boyd, and S. Lall, "A scheme for robust distributed sensor fusion based on average consensus," in Proc. Int. Conf. Information Processing in Sensor Networks, Los Angeles, CA, Apr. 2005, pp. 63-70.
9. L. Xiao, S. Boyd, and S.-J. Kim, "Distributed Average Consensus with Least-Mean-Square Deviation," May 2005, preprint.
10. C. C. Moallemi and B. Van Roy, "Distributed optimization in adaptive networks," in Advances in Neural Information Processing Systems 16, S. Thrun, L. Saul, and B. Achölkopf, Eds. Cambridge, MA: MIT Press, 2004.
11. P. Flajolet and G. N. Martin, "Probabilistic counting algorithms for data base applications," J. Comput. Syst. Sci., vol. 31, no. 2, pp. 182-209, 1985.
12. J. Considine, F. Li, G. Kollios, and J. Byers, "Approximate aggregation techniques for sensor databases," in Proc. Int. Conf. Data Engineering, Boston, MA, Mar. 2004, p. 449.
13. D. Mosk-Aoyama and D. Shah, Information Dissemination via Gossip: Applications to Averaging and Coding, 2005, preprint.
14. J. N. Tsitsiklis, "Problems in decentralized decision-making and computation," Ph.D. dissertation, MIT, Cambridge, MA, 1984.
15. V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis, "Convergence in multiagent coordination, consensus, and flocking," in Proc. Joint 44th IEEE Conf. Decision and Control and European Control Conference, Seveille, Spain, Dec. 2005, pp. 2996-3000.
16. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Foundations of Computer Science, 2003. Proc. 44th Annu, IEEE Symp. Theory of Computing, Cambridge, MA, Oct. 2003, pp. 482-491.
17. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip algorithms: Design, analysis and applications," in Proc. IEEE Infocom, Miami, FL, Mar. 2005, pp. 1653-1664.
18. P. Rusmevichientong and B. Van Roy, "An analysis of belief propagation on the turbo decoding graph with Gaussian densities," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 745-765, Feb. 2001.
19. S. Tatikonda and M. I. Jordan, "Loopy belief propagation and Gibbs measures," in Proc. Conf. Uncertainty in Artificial Intelligence, Edmonton, AB, Canada, Aug. 2002, vol. 18, pp. 493-500.
20. T. Heskes, "On the uniqueness of loopy belief propagation fixed points," Neural Comput., vol. 16, no. 11, pp. 2379-2413, 2004.
21. A. T. Ihler, J.W. Fisher, III, and A. S. Willsky, "Message errors in belief propagation," in Advances in Neural Information Processing Systems 17, L. K. Saul, Y. Weiss, and L. Bottou, Eds. Cambridge, MA: MIT Press, 2005, pp. 609-616.
22. J. M. Mooij and H. J. Kappen, Sufficient Conditions for Convergence of Loopy Belief Propagation, Apr. 2005, preprint.
23. G. Forney, F. Kschischang, and B. Marcus, "Iterative decoding of tail-biting trelisses," in Proc. 1998 Information Theory Workshop, Killarney, Ireland, Jun. 1998.
24. S. M. Aji, G. B. Horn, and R. J. McEliece, "On the convergence of iterative decoding on graphs with a single cycle," in Proc. Conf. Information Science and Systems, Princeton, NJ, 1998.
25. Y. Weiss and W. T. Freeman, "Correctness of local probability propagation in graphical models with loops," Neural Comput., vol. 12, pp. 1-41, 2000.
26. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
27. M. Bayati, D. Shah, and M. Sharma, "Maximum weight matching via max-product belief propagation," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1763-1767.
28. Y. Weiss and W. T. Freeman, "Correctness of belief propagation in Gaussian graphical models of arbitrary topology," Neural Comput., vol. 13, pp. 2173-2200, 2001.
29. J. K. Johnson, D. M. Malioutov, and A. S. Willsky, "Walk-sum interpretation and analysis of Gaussian belief propagation," in Advances in Neural Information Processing Systems 18, Y. Weiss, B. Schölkopf, and J. Platt, Eds. Cambridge, MA: MIT Press, 2006, pp. 579-586.
30. C. C. Moallemi and B. Van Roy, Convergence of the Min-Sum Message Passing Algorithm for Quadratic Optimization, Mar. 2006, preprint.
31. V. Saligrama, M. Alanyali, and O. Savas, Asynchronous Distributed Detection in Sensor Networks, 2005, preprint.
32. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
33. M. J. Wainwright, T. Jaakkola, and A. S. Willsky, "Tree-based reparameterization framework for analysis of sum-product and related algorithms," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1120-1146, May 2003.
34. S. Boyd, P. Diaconis, J. Sun, and L. Xiao, "Fastest mixing Markov chain on a path," Amer. Math. Monthly, vol. 113, no. 1, pp. 70-74, Jan. 2006.
35. S. Boyd, P. Diaconis, P. Parillo, and L. Xiao, "Symmetry analysis of reversible Markov chains," Internet Math., vol. 2, no. 1, pp. 31-71, 2005.
36. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Mixing times for random walks on geometric random graphs," in Proc. SIAM Workshop on Analytic Algorithms and Combinatorics, Vancouver, BC, Canada, jan. 2005.
37. P. Diaconis, S. Holmes, and R. Neal, "Analysis of a nonreversible Markov chain sampler," Ann. Appl. Probab., vol. 10, no. 3, pp. 726-752, 2000.
38. S. Roch, "Bounded fastest mixing," Electron. Commun. Probab., vol. 10, pp. 282-296, 2005.