Determining majority in networks with local interactions and very small local memory
type: Item
instance of: scholarly article
title: Determining majority in networks with local interactions and very small local memory
zbMATH Open document ID: 1404.68021
author: George B. Mertzios
author: Sotiris E. Nikoletseas
author: Christoforos L. Raptopoulos
author: P. G. Spirakis
published in: Distributed Computing
publication date: 2017-03-29T00:00:00Z
full work available at URL: 19002.pdf
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6697936
zbMATH Keywords: majority in networks
zbMATH Keywords: population protocol
zbMATH Keywords: probabilistic scheduler
zbMATH Keywords: coupling
MaRDI profile type: Publication
OpenAlex ID: W2472645009
cites work: Fast and exact majority in population protocols
cites work: Computation in networks of passively mobile finite-state sensors
cites work: Fast computation by population protocols with a leader
cites work: A simple population protocol for fast robust approximate majority
cites work: Randomized Algorithms for Determining the Majority on Graphs
cites work: Reaching a Consensus
cites work: Convergence speed of binary interval consensus
cites work: Ergodic theorems for weakly interacting infinite systems and the voter model
cites work: Extremal Combinatorics
cites work: Q3917278
cites work: The Byzantine Generals Problem
cites work: Q4832431
cites work: Determining Majority in Networks with Local Interactions and Very Small Local Memory
cites work: Q3266127
cites work: Markov Chains
cites work: Q5486447
cites work: Optimization of Reduced Dependencies for Synchronous Sequential Machines
cites work: On computing majority by comparisons
DOI: 10.1007/S00446-016-0277-8
Recommended article: Determining Majority in Networks with Local Interactions and Very Small Local Memory
Recommended article: MAJORITY-VOTE ON DIRECTED SMALL-WORLD NETWORKS
Recommended article: Q6084363
Recommended article: Local Majority Dynamics on Preferential Attachment Graphs
Recommended article: The effect of local majority on global majorityin connected graphs
Recommended article: Majority-vote model on a dynamic small-world network
Recommended article: Majority dynamics on sparse random graphs
Recommended article: Q3411609
Recommended article: EIGENMODE OF THE DECISION-BY-MAJORITY PROCESS IN COMPLEX NETWORKS
description: scientific article; zbMATH DE number 6697936