2019 · 23 citations · 22 references
ComputingData ScienceEdge ComputingInformation TheoryTime Series AnalysisGraph AlgorithmsGraph AnalyticsGraph TheoryGraph-based LearningNetwork TopologySignal ProcessingCovarianceEigenvectorsGraph Signal ProcessingNetwork Topology ReconstructionSignalsTopology Inference
We address the problem of online topology inference from streaming nodal observations of graph signals generated by linear diffusion dynamics on the sought graph. To that end, we leverage the stationarity of the signals and use the so-called graph-shift operator (GSO) as a matrix representation of the graph. Under this model, estimated covariance eigenvectors obtained from streaming independent graph signals diffused on the sought network are a valid estimator of the GSO's spectral templates. We develop an ADMM algorithm to find a sparse and structurally admissible GSO given the eigenvectors estimate. Then, we propose an online scheme that upon sensing new diffused observations, efficiently updates eigenvectors (thus makes more accurate on expectation) and performs only one or a few iterations of the mentioned ADMM until the new data is observed. Numerical tests illustrate the effectiveness of the proposed topology inference approach in recovering large scale graphs, adapting to streaming information, and accommodating changes in the sought network.
22
David I Shuman, Sunil K. Narang, Pascal Frossard et al. · IEEE Signal Processing Magazine · 2013 · 4.4K citations · Full text
Mapping the Structural Core of Human Cerebral Cortex
Patric Hagmann, Leila Cammoun, Xavier Gigandet et al. · PLoS Biology · 2008 · 4.4K citations · Full text
High dimensional graphs and variable selection with the Lasso
2006 · 2.7K citations