On an application of convexity to discrete systems
Discrete Applied Mathematics
On pre-periods of discrete influence systems
Discrete Applied Mathematics
Neural and automata networks: dynamical behavior and applications
Neural and automata networks: dynamical behavior and applications
The r-majority vote action on 0-1 sequences
Discrete Mathematics
Parametrization for stationary patterns of the r-majority operators on 0-1 sequences
Discrete Mathematics
Size bounds for dynamic monopolies
Discrete Applied Mathematics
Distributed Probabilistic Polling and Applications to Proportionate Agreement
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Probabilistic local majority voting for the agreement problem on finite graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Stable sets of threshold-based cascades on the erdős-rényi random graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Discrete Applied Mathematics
Triggering cascades on undirected connected graphs
Information Processing Letters
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science
| Hi-index | 0.00 |
We study a rather generic communication/coordination/ computation problem: in a finite network of agents, each initially having one of the two possible states, can the majority initial state be computed and agreed upon by means of local computation only? We describe the architecture of networks that are always capable of reaching the consensus on the majority initial state of its agents. In particular, we show that, for any truly local network of agents, there are instances in which the network is not capable of reaching such consensus. Thus, every truly local computation approach that requires reaching consensus is not failure-free.