Asynchronous Distributed Edge-Variant Graph Filters

As the size of the sensor network grows, synchronization starts to become the main bottleneck for distributed computing. As a result, efforts in several areas have been focused on the convergence analysis of asynchronous computational methods. In this work, we aim to cross-pollinate distributed graph filters with results in parallel computing to provide guarantees for asynchronous graph filtering. To alleviate the possible reduction of convergence speed due to asynchronous updates, we also show how a slight modification to the graph filter recursion, through operator splitting, can be performed to obtain faster convergence. Finally, through numerical experiments the performance of the discussed methods is illustrated.