From Gossip to Voting
Event details
| Date | 17.06.2014 |
| Hour | 15:15 |
| Speaker | Patrick Thiran, EPFL |
| Location | |
| Category | Conferences - Seminars |
An increasingly larger number of applications require networks to perform decentralized computations over distributed data. A representative problem of these ``in-network processing" tasks is the distributed computation of the average of values present at nodes of a network, known as gossip algorithms. They have received recently significant attention across different communities (networking, algorithms, signal processing, control) because they constitute simple and robust methods for distributed information processing over networks. The first part of the talk is a short survey of some results on real-valued (analog) gossip algorithms. The second part is devoted to quantized gossip on arbitrary connected networks, and to a particular instance of this problem, the voting problem: nodes initially vote for Yes (1) or No (0), and they want to know the majority opinion. We show that the majority voting problem is solvable with only 2 bits of memory per agent.
(This is a joint work with Florence Bénézit and Martin Vetterli).
(This is a joint work with Florence Bénézit and Martin Vetterli).
Links
Practical information
- General public
- Free
Organizer
- Boi Faltings
Contact
- Sylvie Thomet