mlsanityData to 7 Oct 2026

Sparsistent filtering of comovement networks from high-dimensional data

arXiv 2101.09174 ↗First posted 22 Jan 2021stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Network filtering is an important form of dimension reduction to isolate the core constituents of large and interconnected complex systems. We introduce a new technique to filter large dimensional networks arising out of dynamical behavior of the constituent nodes, exploiting their spectral properties. As opposed to the well known network filters that rely on preserving key topological properties of the realized network, our method treats the spectrum as the fundamental object and preserves spectral properties. Applying asymptotic theory for high dimensional data for the filter, we show that it can be tuned to interpolate between zero filtering to maximal filtering that induces sparsity and consistency while having the least spectral distance from a linear shrinkage estimator. We apply our proposed filter to covariance networks constructed from financial data, to extract the key subnetwork embedded in the full sample network.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 4 of its 44 references that are in the map. First posted on arXiv 22 Jan 2021.

Builds on

4 of 44 references.

References · 4

  1. 2019A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarseningcited by 31
  2. 2016Parsimonious modeling with Information Filtering Networkscited by 14
  3. 2017Network Backboning with Noisy Datacited by 11
  4. 2016Structure-Preserving Sparsification Methods for Social Networkscited by 10

Built on by

Not cited yet.