Retaining positive definiteness in thresholded matrices
From MaRDI portal
Abstract: Positive definite (p.d.) matrices arise naturally in many areas within mathematics and also feature extensively in scientific applications. In modern high-dimensional applications, a common approach to finding sparse positive definite matrices is to threshold their small off-diagonal elements. This thresholding, sometimes referred to as hard-thresholding, sets small elements to zero. Thresholding has the attractive property that the resulting matrices are sparse, and are thus easier to interpret and work with. In many applications, it is often required, and thus implicitly assumed, that thresholded matrices retain positive definiteness. In this paper we formally investigate the algebraic properties of p.d. matrices which are thresholded. We demonstrate that for positive definiteness to be preserved, the pattern of elements to be set to zero has to necessarily correspond to a graph which is a union of disconnected complete components. This result rigorously demonstrates that, except in special cases, positive definiteness can be easily lost. We then proceed to demonstrate that the class of diagonally dominant matrices is not maximal in terms of retaining positive definiteness when thresholded. Consequently, we derive characterizations of matrices which retain positive definiteness when thresholded with respect to important classes of graphs. In particular, we demonstrate that retaining positive definiteness upon thresholding is governed by complex algebraic conditions.
Recommendations
- Functions preserving positive definiteness for sparse matrices
- Preserving positivity for matrices with sparsity constraints
- Sparse matrix decompositions and graph characterizations
- Positivity of Hadamard powers of a few band matrices
- Positive-definite _1-penalized estimation of large covariance matrices
Cites work
- A General Framework for Weighted Gene Co-Expression Network Analysis
- Algorithmic graph theory and perfect graphs
- Covariance regularization by thresholding
- Flexible covariance estimation in graphical Gaussian models
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 3303822 (Why is no real title available?)
- Large-Scale Correlation Screening
- Wishart distributions for decomposable covariance graph models
Cited in
(15)- The critical exponent: a novel graph invariant
- Simultaneous kernels of matrix Hadamard powers
- High-dimensional correlation matrix estimation for general continuous data with Bagging technique
- Preserving positivity for matrices with sparsity constraints
- Matrix positivity preservers in fixed dimension. I
- A panorama of positivity. II: Fixed dimension
- Sparse matrix decompositions and graph characterizations
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
- Complete characterization of Hadamard powers preserving Loewner positivity, monotonicity, and convexity
- Matrix positivity preservers in fixed dimension
- Preserving positivity for rank-constrained matrices
- Functions preserving positive definiteness for sparse matrices
- Positivity preservers over finite fields
- Negativity-preserving transforms of tuples of symmetric matrices
- Critical exponents of graphs
This page was built for publication: Retaining positive definiteness in thresholded matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414695)
