Privacy Preserving Randomized Gossip Algorithms
classification
🧮 math.OC
keywords
algorithmsgossiprandomizedaverageboundscomplexityconsensusdifferent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.