Large-Scale Correlation Screening
From MaRDI portal
Abstract: This paper treats the problem of screening a p-variate sample for strongly and multiply connected vertices in the partial correlation graph associated with the the partial correlation matrix of the sample. This problem, called hub screening, is important in many applications ranging from network security to computational biology to finance to social networks. In the area of network security, a node that becomes a hub of high correlation with neighboring nodes might signal anomalous activity such as a coordinated flooding attack. In the area of computational biology the set of hubs of a gene expression correlation graph can serve as potential targets for drug treatment to block a pathway or modulate host response. In the area of finance a hub might indicate a vulnerable financial instrument or sector whose collapse might have major repercussions on the market. In the area of social networks a hub of observed interactions between criminal suspects could be an influential ringleader. The techniques and theory presented in this paper permit scalable and reliable screening for such hubs. This paper extends our previous work on correlation screening [arXiv:1102.1204] to the more challenging problem of partial correlation screening for variables with a high degree of connectivity. In particular we consider 1) extension to the more difficult problem of screening for partial correlations exceeding a specified magnitude; 2) extension to screening variables whose vertex degree in the associated partial correlation graph, often called the concentration graph, exceeds a specified degree.
Recommendations
- Large correlation analysis
- Correlation and Large-Scale Simultaneous Significance Testing
- Interaction screening via canonical correlation
- A NEW PROCEDURE FOR ASSESSING LARGE SETS OF CORRELATIONS
- Robust rank correlation based screening
- Interaction screening by partial correlation
- Stable correlation and robust feature screening
- Interaction screening for ultrahigh-dimensional data
- Sure screening by ranking the canonical correlations
Cited in
(23)- Stable estimation of a covariance matrix guided by nuclear norm penalties
- A testing based approach to the discovery of differentially correlated variable sets
- Properties of eigenvalues and eigenvectors of large-dimensional sample correlation matrices
- Dynamic tilted current correlation for high dimensional variable screening
- Matrix positivity preservers in fixed dimension. I
- High-dimensional inference on covariance structures via the extended cross-data-matrix methodology
- A panorama of positivity. II: Fixed dimension
- Correlation tests for high-dimensional data using extended cross-data-matrix methodology
- Phase transition in limiting distributions of coherence of high-dimensional random matrices
- Retaining positive definiteness in thresholded matrices
- Statistical inference for high-dimension, low-sample-size data
- Graphical Markov models for infinitely many variables
- Complete characterization of Hadamard powers preserving Loewner positivity, monotonicity, and convexity
- Asymptotics of eigenstructure of sample correlation matrices for high-dimensional spiked models
- Schur polynomials and matrix positivity preservers
- Preserving positivity for rank-constrained matrices
- Spectral correlation hub screening of multivariate time series
- Optimal screening and discovery of sparse signals with applications to multistage high throughput studies
- Functions preserving positive definiteness for sparse matrices
- Large-scale correlation screening under dependence for brain functional connectivity network inference
- Clustering-based inter-regional correlation estimation
- Ridge-type covariance and precision matrix estimators of the multivariate normal distribution
- Critical exponents of graphs
This page was built for publication: Large-Scale Correlation Screening
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225816)
