Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard
Vincent D. Blondel
,
Alex Olshevsky
Type:
Preprint
Publication Date:
2012-02-14
Citations:
1
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard
2012
Vincent D. Blondel
Alex Olshevsky
+
PDF
Chat
How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard
2014
Vincent D. Blondel
Alex Olshevsky
+
On the Cost of Deciding Consensus
2012
Vincent D. Blondel
Alex Olshevsky
+
PDF
Chat
Reachability of consensus and synchronizing automata
2015
Pierre‐Yves Chevalier
Julien M. Hendrickx
Raphaël M. Jungers
+
Reachability of Consensus and Synchronizing Automata
2015
Pierre‐Yves Chevalier
Julien M. Hendrickx
Raphaël M. Jungers
+
Reachability of Consensus and Synchronizing Automata
2015
Pierre‐Yves Chevalier
Julien M. Hendrickx
Raphaël M. Jungers
+
A Combinatorial Necessary and Sufficient Condition for Cluster Consensus
2015
Yilun Shang
+
PDF
Chat
Consensus Convergence with Stochastic Effects
2016
Josselin Garnier
George Papanicolaou
Tzu-Wei Yang
+
Sets of Stochastic Matrices with Converging Products: Bounds and Complexity.
2017
Pierre‐Yves Chevalier
Vladimir V. Gusev
Raphaël M. Jungers
Julien M. Hendrickx
+
Sets of Stochastic Matrices with Converging Products: Bounds and Complexity
2017
Pierre‐Yves Chevalier
Vladimir V. Gusev
Raphaël M. Jungers
Julien M. Hendrickx
+
Randomized Consensus Processing over Random Graphs: Independence and Convergence
2011
Guodong Shi
Karl Henrik Johansson
+
Finite-time consensus using stochastic matrices with positive diagonals
2013
Julien M. Hendrickx
Guodong Shi
Karl Henrik Johansson
+
Finite-time consensus using stochastic matrices with positive diagonals
2013
Julien M. Hendrickx
Guodong Shi
Karl Henrik Johansson
+
PDF
Chat
Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals
2014
Julien M. Hendrickx
Guodong Shi
Karl Henrik Johansson
+
Stochastic approximation for consensus over general digraphs with Markovian switches
2014
Minyi Huang
Tao Li
Ji‐Feng Zhang
+
PDF
Chat
The projection method for reaching consensus and the regularized power limit of a stochastic matrix
2011
Rafig Agaev
Pavel Chebotarev
+
PDF
Chat
Efficient Algorithms for the Consensus Decision Problem
2015
P.-Y. Chevalier
Julien M. Hendrickx
Raphaël M. Jungers
+
PDF
Chat
Making Consensus Tractable
2013
Elchanan Mossel
Omer Tamuz
+
PDF
Chat
Consensus and Products of Random Stochastic Matrices: Exact Rate for Convergence in Probability
2013
Dragana Bajović
João Xavier
eM. F. Moura
Bruno Sinopoli
+
PDF
Chat
Fast deterministic consensus in a noisy environment
2002
James Aspnes
Works That Cite This (1)
Action
Title
Year
Authors
+
On Primitivity of Sets of Matrices
2013
Vincent D. Blondel
Raphaël M. Jungers
Alex Olshevsky
Works Cited by This (6)
Action
Title
Year
Authors
+
Efficient information aggregation strategies for distributed control and signal processing
2010
Alexander Olshevsky
+
The Lyapunov exponent and joint spectral radius of pairs of matrices are hard?when not impossible?to compute and to approximate
1997
John N. Tsitsiklis
Vincent D. Blondel
+
PDF
Chat
A stabilization theorem for dynamics of continuous opinions
2005
Jan Lorenz
+
PDF
Chat
Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
2012
Julien M. Hendrickx
John N. Tsitsiklis
+
PDF
Chat
On Conditions for Convergence to Consensus
2010
Jan Lorenz
Dirk A. Lorenz
+
PDF
Chat
Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
2008
Feng Xiao
Long Wang