Two distributed protocols built from a cofactor-weighted mirror graph achieve signed-average consensus on strongly connected signed digraphs if and only if the digraph is structurally balanced, with a nonlinear fixed-time variant.
Reaching a cons ensus in a dynamically changing environment: A graphical approac h,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Distributed Averaging Problems over Directed Signed Networks
Two distributed protocols built from a cofactor-weighted mirror graph achieve signed-average consensus on strongly connected signed digraphs if and only if the digraph is structurally balanced, with a nonlinear fixed-time variant.