{'fraction_non_alphanumeric': 0.015567765567765568, 'fraction_numerical': 0.0, 'mean_word_length': 5.317919075144508, '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}}
Consensus-based distributed estimation of Laplacian eigenvalues of undirected graphs

In this paper, we present a novel algorithm for estimating eigenvalues of the Laplacian matrix associated with the graph describing the network topology of a multi-agent system or a wireless sensor network. As recently shown, the average consensus matrix can be written as a product of Laplacian based consensus matrices whose stepsizes are given by the inverse of the nonzero Laplacian eigenvalues. Therefore, by solving the factorization of the average consensus matrix, we can infer the Laplacian eigenvalues. We show how solving such a matrix factorization problem in a distributed way. In particular, we formulate the problem as a constrained consensus problem. The proposed algorithm does not require great resources in both computation and storage. This algorithm can also be viewed as a way for decentralizing the design of finite-time average consensus protocol recently proposed in the literature. Eventually, the performance of the proposed algorithm is evaluated by means of simulation results.