Pongrácz, András (2020) Discordant voting protocols for cyclically linked agents. ELECTRONIC JOURNAL OF COMBINATORICS, 27 (1). ISSN 1077-8926
|
Text
cyclic_graph_disc.pdf Download (270kB) | Preview |
Official URL: https://www.combinatorics.org/ojs/index.php/eljc/a...
Abstract
Voting protocols, such as the push and the pull protocol, model the behavior of people during an election. These processes have been studied in distributed computing in peer-to-peer networks, and to describe how viruses or rumors spread in a community. We determine the asymptotic behavior of the runtime of discordant linear protocols on the cycle graph, and the probability for each consensus to win.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet Q Science / természettudomány > QA Mathematics / matematika > QA72 Algebra / algebra |
| Depositing User: | Dr. András Pongrácz |
| Date Deposited: | 14 Sep 2020 12:29 |
| Last Modified: | 03 Apr 2023 06:54 |
| URI: | http://real.mtak.hu/id/eprint/113209 |
Actions (login required)
 |
Edit Item |
