Privacy Preserving Randomized Gossip Algorithms
Abstract
In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for all methods, and perform extensive numerical experiments.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2017
- DOI:
- 10.48550/arXiv.1706.07636
- arXiv:
- arXiv:1706.07636
- Bibcode:
- 2017arXiv170607636H
- Keywords:
-
- Mathematics - Optimization and Control
- E-Print:
- 38 pages