Distributed Graph Estimation under Laplacian Constraints

doi:10.1016/j.sigpro.2022.108744

2023-01-01

DOI：10.1016/j.sigpro.2022.108744

原文链接

查看原文

摘要

En 中文

In recent years, distributed estimation of graph Laplacian matrices for smooth graph signals has received much attention. Traditional methods for estimating the graph Laplacian matrices usually estimate the global parameters in a centralized manner, which is computationally intensive and hard to apply in large-scale networks. In this paper, in order to reduce the computational complexity and meanwhile maintain the estimation accuracy, we propose a distributed graph Laplacian matrix estimation method called the distributed combinatorial graph Laplacian estimation (DCGL). In our method, a local parameter estimation problem is first formulated for each vertex by maximizing the marginal likelihood of the data collected from the neighborhood of the vertex. Then, by discussing the connectivity and Laplacian property of the marginal precision matrix, the Laplacian and structural constraints are added to each local estimation problem to resolve the non-convexity between the local and global estimates. Finally, through a simple and single message-passing rule, the global graph Laplacian matrix is obtained by extracting, combining, and symmetrizing the locally estimated parameters. Experiments on synthetic and real datasets demon-strate that the proposed distributed estimator is asymptotically consistent in the classical regime while having advantages in the high-dimensional regime.(c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )

Keyword:

Distributed estimation

Graph Laplacian matrix

Maximizing marginal likelihood

Attractive DC-intrinsic Gaussian Markov

random field

Precision matrix