Consensus State Gram Matrix Estimation for Stochastic Switching Networks from Spectral Distribution Moments
2017 FIFTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS(2017)
摘要
Reaching distributed average consensus quickly and accurately over a network through iterative dynamics represents an important task in numerous distributed applications. Suitably designed filters applied to the state values can significantly improve the convergence rate. For constant networks, these filters can be viewed in terms of graph signal processing as polynomials in a single matrix, the consensus iteration matrix, with filter response evaluated at its eigenvalues. For random, time-varying networks, filter design becomes more complicated, involving eigendecompositions of sums and products of random, time-varying iteration matrices. This paper focuses on deriving an estimate for the Gram matrix of error in the state vectors over a filtering window for large-scale, stationary, switching random networks. The result depends on the moments of the empirical spectral distribution, which can be estimated through Monte-Carlo simulation. This work then defines a quadratic objective function to minimize the expected consensus estimate error norm. Simulation results provide support for the approximation.
更多查看译文
关键词
distributed average consensus,filter design,graph signal processing,random matrix,random network,spectral statistics,time-varying network
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络