Coordinated decentralized estimation over random networks

In this paper, we consider three representative problems on observability and estimation over networks in presence of randomness. The aim of this work is to highlight that these problems, among many others, can be approached via a unified formulation, that can be subsequently be utilized for proving almost sure stability and convergence of filtering algorithms over distinct classes of random networks. More specifically, we show stability and convergence properties of random variations on the coordinated decentralized estimation using this approach.