### Abstract

The problem addressed in this paper is the analysis of a distributed consensus algorithm for arbitrary networks, proposed by Bénézit et al. In the initial setting, each node in the network has one of two possible states ("yes" or "no"). Nodes can update their states by communicating with their neighbors via a 2-bit message in an asynchronous clock setting. Eventually, all nodes reach consensus on the majority states. We use the theory of electric networks, random walks, and couplings of Markov chains to derive an O(N ^{4} log N) upper bound for the expected convergence time on an arbitrary graph of size N.

Original language | English (US) |
---|---|

Title of host publication | 15th International Conference on Information Fusion, FUSION 2012 |

Pages | 369-375 |

Number of pages | 7 |

State | Published - Oct 24 2012 |

Event | 15th International Conference on Information Fusion, FUSION 2012 - Singapore, Singapore Duration: Sep 7 2012 → Sep 12 2012 |

### Publication series

Name | 15th International Conference on Information Fusion, FUSION 2012 |
---|

### Other

Other | 15th International Conference on Information Fusion, FUSION 2012 |
---|---|

Country | Singapore |

City | Singapore |

Period | 9/7/12 → 9/12/12 |

### All Science Journal Classification (ASJC) codes

- Information Systems

### Keywords

- Distributed binary consensus
- convergence time
- gossip

## Fingerprint Dive into the research topics of 'An upper bound on the convergence time for distributed binary consensus'. Together they form a unique fingerprint.

## Cite this

*15th International Conference on Information Fusion, FUSION 2012*(pp. 369-375). [6289826] (15th International Conference on Information Fusion, FUSION 2012).