Consensus Propagation
From MaRDI portal
Abstract: We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regular graphs, and demonstrate that the protocol exhibits better scaling properties than pairwise averaging, an alternative that has received much recent attention. Consensus propagation can be viewed as a special case of belief propagation, and our results contribute to the belief propagation literature. In particular, beyond singly-connected graphs, there are very few classes of relevant problems for which belief propagation is known to converge.
Recommendations
Cited in
(12)- Protocols forcing consensus
- Resilient multi-dimensional consensus in adversarial environment
- Distributed algorithms for aggregative games on graphs
- Average consensus on networks with quantized communication
- Consensus Driven by the Geometric Mean
- Linear time average consensus and distributed optimization on fixed graphs
- A new approach to Laplacian solvers and flow problems
- Convergence of Gaussian belief propagation under general pairwise factorization: connecting Gaussian MRF with pairwise linear Gaussian model
- The Building Blocks of Consensus
- Consensus with ternary messages
- Consensus in distributed estimation with inconsistent beliefs
- Discrete-time dynamic average consensus
This page was built for publication: Consensus Propagation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548109)