Name
Abstract | ||
|---|---|---|
Given a connected graph G whose vertices are coloured in some way, a discordant voting process on G is as follows. At each step a pair of adjacent vertices with different colours interact, and one of the vertices changes its colour to match the other one. If eventually all vertices have the same colour, we say a consensus has been reached. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jda.2018.07.001 | Journal of Discrete Algorithms |
Keywords | Field | DocType |
Random processes,Voting algorithms,Distributed computing | Discrete mathematics,Complete graph,Combinatorics,Voting,Vertex (geometry),Simple random sample,Stochastic process,Connectivity,Scaling,Mathematics | Journal |
Volume | ISSN | Citations |
50 | 1570-8667 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colin Cooper | 1 | 287 | 30.73 |
| Nicolas Rivera | 2 | 27 | 8.52 |