Phase transition of the 2-choices dynamics on core-periphery networks
type: Item
instance of: scholarly article
title: Phase transition of the 2-choices dynamics on core-periphery networks
author: Emilio Cruciani
author: Emanuele Natale
author: André Nusser
author: Giacomo Scornavacca
published in: Distributed Computing
publication date: 2021-09-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1804.07223
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 7391593
zbMATH Keywords: opinion dynamics
zbMATH Keywords: core periphery networks
zbMATH Keywords: Markov chains
describes a project that uses: KONECT
describes a project that uses: SNAP
MaRDI profile type: Publication
OpenAlex ID: W3165247984
cites work: Distributed Computing on Core-Periphery Networks: Axiom-Based Design
cites work: Bootstrap percolation on the hypercube
cites work: Bootstrap percolation on the random regular graph
cites work: Plurality Consensus in the Gossip Model
cites work: Simple dynamics for plurality consensus
cites work: Stabilizing Consensus with Many Opinions
cites work: Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
cites work: Efficient plurality consensus, or: The benefits of cleaning up from time to time
cites work: Bounds on the Voter Model in Dynamic Networks
cites work: Dynamic monopolies of constant size
cites work: Q2753729
cites work: Discordant Voting Processes on Finite Graphs
cites work: The Power of Two Choices in Distributed Voting
cites work: Fast consensus for voting on general expander graphs
cites work: The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process
cites work: The Linear Voting Model
cites work: Q4931752
cites work: Reaching a Consensus
cites work: Concentration of measure for the analysis of randomized algorithms.
cites work: Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics
cites work: A Polylogarithmic Gossip Algorithm for Plurality Consensus
cites work: Distributed probabilistic polling and applications to proportionate agreement
cites work: The mathematics of infectious diseases
cites work: Expander graphs and their applications
cites work: Q3063920
cites work: Bootstrap percolation on the random graph \(G_{n,p}\)
cites work: Majority dynamics on trees and the dynamic cavity method
cites work: Q4595047
cites work: Q5185817
cites work: Q4265490
cites work: Opinion exchange dynamics
cites work: Size bounds for dynamic monopolies
cites work: Local majorities, coalitions and monopolies in graphs: A review
cites work: Core-Periphery Structure in Networks
cites work: Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
cites work: Dynamic monopolies in two-way bootstrap percolation
cites work: Fast plurality consensus in regular expanders
DOI: 10.1007/S00446-021-00396-5
description: scientific article; zbMATH DE number 7391593