Discordant Voting Processes on Finite Graphs
- Submitting institution
-
The University of Leeds
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- UOA11-97
- Type
- D - Journal article
- DOI
-
10.1137/16M1105979
- Title of journal
- SIAM Journal on Discrete Mathematics
- Article number
- -
- First page
- 2398
- Volume
- 32
- Issue
- 4
- ISSN
- 0895-4801
- Open access status
- Exception within 3 months of publication
- Month of publication
- October
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
A - AC (Algorithms and Complexity)
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Studies three simple protocols for achieving distributed consensus in a netwok, which has recently become of great practical interest in relation to distributed ledgers such as Algorand, inspired by Bitcoin. The three protocols studied are called push, pull and oblivious. In the third, the time to reach consensus is shown to be independent of network structure. While the other two seem very similar at first sight, in fact they behave very differently for different network structures, with the time to reach consensus being fast for one type of graph, and exponential for another. Extends ICALP-16 paper(DOI:10.4230/LIPIcs.ICALP.2016.145).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
