Pages that link to "Item:Q1854483"
From MaRDI portal
The following pages link to Distributed probabilistic polling and applications to proportionate agreement (Q1854483):
Displaying 39 items.
- Probabilistic consensus via polling and majority rules (Q475128) (← links)
- Global majority consensus by local majority polling on graphs of a given degree sequence (Q476295) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- On the expected time for Herman's probabilistic self-stabilizing algorithm (Q817822) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion (Q1028139) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- A computational study of \(f\)-reversible processes on graphs (Q1752484) (← links)
- Distributed probabilistic polling and applications to proportionate agreement (Q1854483) (← links)
- Phase transition of the 2-choices dynamics on core-periphery networks (Q1981807) (← links)
- Phase transition of the 3-majority dynamics with uniform communication noise (Q2097340) (← links)
- On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
- Step-by-step community detection in volume-regular graphs (Q2210514) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Discordant voting protocols for cyclically linked agents (Q2309228) (← links)
- Simple dynamics for plurality consensus (Q2401681) (← links)
- Voter and majority dynamics with biased and stubborn agents (Q2658888) (← links)
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)
- THE PROPORTIONAL LOTTERY PROTOCOL IS STRONGLY β-PARTICIPATORY AND VNM-STRATEGY-PROOF (Q3606363) (← links)
- A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem (Q4506267) (← links)
- Reaching consensus on a connected graph (Q4684846) (← links)
- Discordant Voting Processes on Finite Graphs (Q4691143) (← links)
- A tight analysis of the parallel undecided-state dynamics with two colors (Q5005128) (← links)
- Towards Control of Opinion Diversity by Introducing Zealots into a Polarised Social Group (Q5050337) (← links)
- Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions (Q5100964) (← links)
- Find Your Place: Simple Distributed Algorithms for Community Detection (Q5115703) (← links)
- A control‐theoretic perspective on the design of distributed agreement protocols (Q5300160) (← links)
- Reversible random walks on dynamic graphs (Q6063351) (← links)
- Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models (Q6074651) (← links)
- Phase transition of the \(k\)-majority dynamics in biased communication models (Q6099029) (← links)
- Global information from local observations of the noisy voter model on a graph (Q6142955) (← links)
- Biased opinion dynamics: when the devil is in the details (Q6149529) (← links)
- Simplified Chernoff bounds with powers-of-two probabilities (Q6161458) (← links)
- Voting protocols on the star graph (Q6548057) (← links)
- Asynchronous opinion dynamics in social networks (Q6601208) (← links)
- Asymptotic behaviour of the noisy voter model density process (Q6620077) (← links)
- Quasi-majority functional voting on expander graphs (Q6641063) (← links)
- Phase transition of the 3-majority opinion dynamics with noisy interactions (Q6664059) (← links)
