Cooper, C, Dyer, M, Frieze, A et al. (1 more author) (2018) Discordant Voting Processes on Finite Graphs. SIAM Journal on Discrete Mathematics, 32 (4). pp. 2398-2420. ISSN 0895-4801
Abstract
We consider an asynchronous voting process on graphs called discordant voting, which can be described as follows. Initially each vertex holds one of two opinions, red or blue. Neighboring vertices with different opinions interact pairwise along an edge. After an interaction both vertices have the same color. The quantity of interest is the time to reach consensus, i.e., the number of steps needed for all vertices have the same color. We show that for a given initial coloring of the vertices, the expected time to reach consensus depends strongly on the underlying graph and the update rule (i.e., push, pull, oblivious).
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2018, Society for Industrial and Applied Mathematics. Reproduced in accordance with the publisher's self-archiving policy. |
Keywords: | distributed consensus; voter model; discordant voting; interacting particles; discrete random process |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC EP/M004953/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 11 Jan 2019 11:45 |
Last Modified: | 11 Jan 2019 11:52 |
Status: | Published |
Publisher: | Society for Industrial and Applied Mathematics |
Identification Number: | 10.1137/16M1105979 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:140904 |