{'fraction_non_alphanumeric': 0.02748414376321353, 'fraction_numerical': 0.0, 'mean_word_length': 5.32, '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}}
Matrix-weighted consensus with leader-following topologies

In this paper, we report some results on a matrix-weight consensus algorithm. Specifically, the leader-following graph is studied in detail. We study conditions for reaching a consensus in two types of leader-following graphs using the matrix-weighted consensus algorithm. The results will be used to interpret several social behaviors. Simulation results are also provided to vindicate the mathematical analysis.