Optimal Filter Design for Consensus on Random Directed Graphs
Optimal design of consensus acceleration graph filters relates closely to the eigenvalues of the consensus iteration matrix. This task is complicated by random networks with uncertain iteration matrix eigenvalues. Filter design methods based on the spectral asymptotics of consensus iteration matrices for large-scale, random undirected networks have been previously developed both for constant and for time-varying network topologies. This work builds upon these results by extending analysis to large-scale, constant, random directed networks. The proposed approach uses theorems by Girko that analytically produce deterministic approximations of the empirical spectral distribution for suitable non-Hermitian random matrices. The approximate empirical spectral distribution defines filtering regions in the proposed filter optimization problem, which must be modified to accommodate complex-valued eigenvalues. Presented numerical simulations demonstrate good results. Additionally, limitations of the proposed method are discussed.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Spectral Statistics of Directed Networks with Random Link Model Transpose-Asymmetry
Stochastic network influences complicate graph filter design by producing uncertainty in network iteration matrix eigenvalues, the points at which the graph filter response is defined. While joint statistics for the eige…
Designing Consensus-Based Distributed Filtering over Directed Graphs
This paper proposes a novel consensus-on-only-measurement distributed filter over directed graphs under the collectively observability condition. First, the distributed filter structure is designed with an augmented lead…
Learning the Exact Topology of Undirected Consensus Networks
In this article, we present a method to learn the interaction topology of a network of agents undergoing linear consensus updates in a non invasive manner. Our approach is based on multivariate Wiener filtering, which is…
Time SeriesTime Series AnalysisOn observability and optimal gain design for distributed linear filtering and prediction
This paper presents a new approach to distributed linear filtering and prediction. The problem under consideration consists of a random dynamical system observed by a multi-agent network of sensors where the network is s…
Consensus analysis of random sub-graphs for distributed filtering with link failures
In this paper we carry out a stability analysis of a distributed consensus algorithm in presence of link failures. The algorithm combines a new broadcast version of a Push-Sum algorithm, specifically designed for handlin…