{'fraction_non_alphanumeric': 0.014577259475218658, 'fraction_numerical': 0.0, 'mean_word_length': 5.302752293577981, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Achieving consensus on networks with antagonistic interactions

Consensus protocols achieve an agreement among agents thanks to the collaborative efforts of all agents, expresses by a (connected) communication graph with nonnegative weights. The question we ask in this paper is the following: is it possible to achieve a form of agreement in presence of antagonistic interactions, modeled as negative weights on the communication graph? The answer to this question is affirmative: on signed networks all agents can converge to a consensus value which is the same for all except for the sign. Necessary and sufficient conditions are obtained to describe the cases when this is possible.