{'fraction_non_alphanumeric': 0.013786764705882353, 'fraction_numerical': 0.001838235294117647, 'mean_word_length': 5.05, '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}}
Towards a Global Agreement: the Persistent Graph

This paper investigates the role which the persistent links play for a network to reach a global agreement under discrete-time or continuous-time consensus dynamics. Each (directed) arc in the underlying communication graph is assumed to be associated with a timedependent weight function which describes the strength of the information flow between the from one node to another. Then an arc is said to be persistent if its weight function has infinite L1 or l1 norm, and the subgraph which contains all persistent arcs is called the persistent graph. A series of sufficient and necessary conditions on global agreement or ǫ-agreement are established, by which we clearly address that the persistent graph fully determines the convergence to a collective agreement. Convergence rates are given explicitly relying on the diameter of the persistent graph. The results conclude that towards a global agreement, the links which last in a long period contribute fundamentally while the links which are only significant for a short time do not.