Bounds on the Voter Model in Dynamic Networks
From MaRDI portal
Publication:4598289
DOI10.4230/LIPIcs.ICALP.2016.146zbMath1388.68015arXiv1603.01895OpenAlexW2962818201MaRDI QIDQ4598289
Frederik Mallmann-Trenn, George Giakkoupis, Petra Berenbrink, Anne-Marie Kermarrec
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1603.01895
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12)
Related Items (11)
Random Walks on Randomly Evolving Graphs ⋮ Reversible random walks on dynamic graphs ⋮ On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ⋮ Phase transition of the \(k\)-majority dynamics in biased communication models ⋮ Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ Distributed Averaging in Opinion Dynamics ⋮ Phase transition of the 2-choices dynamics on core-periphery networks ⋮ A general model of binary opinions updating ⋮ Unnamed Item ⋮ Discordant Voting Processes on Finite Graphs ⋮ Linking the mixing times of random walks on static and dynamic random graphs
This page was built for publication: Bounds on the Voter Model in Dynamic Networks
