{'fraction_non_alphanumeric': 0.015299026425591099, 'fraction_numerical': 0.0, 'mean_word_length': 5.666666666666667, '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}}
Distributed parameter estimation under unreliable directed networks

Recent research on distributed parameter estimation often focuses on undirected or strongly connected and balanced networks. In this paper, we study the distributed parameter estimation problem for sensor networks under unreliable directed networks. A “consensus+innovation” type algorithm is proposed for each sensor or agent. We prove both mean square and almost sure convergence of the algorithm. We also derive a new general condition for directed networks. In the special case where the networks are undirected or strongly connected and balanced, the condition boils down to the global observability condition considered in the existing results.