Configuration model for correlation matrices preserving the node strength

Abstract

Correlation matrices are a major type of multivariate data. To examine properties of a given correlation matrix, a common practice is to compare the same quantity between the original correlation matrix and reference correlation matrices, such as those derived from random matrix theory, that partially preserve properties of the original matrix. We propose a model to generate such reference correlation and covariance matrices for the given matrix. Correlation matrices are often analysed as networks, which are heterogeneous across nodes in terms of the total connectivity to other nodes for each node. Given this background, the present algorithm generates random networks that preserve the expectation of total connectivity of each node to other nodes, akin to configuration models for conventional networks. Our algorithm is derived from the maximum entropy principle. We will apply the proposed algorithm to measurement of clustering coefficients and community detection, both of which require a null model to assess the statistical significance of the obtained results.

arXiv comment8 figures, 4 tables

References in corpus (30)

• Fast unfolding of communities in large networks
• Community detection in graphs
• Weak pairwise correlations imply strongly correlated network states in a neural population
• Scale-free brain functional networks
• Noise Dressing of Financial Correlation Matrices
• Universal Behavior of Load Distribution in Scale-free Networks
• Intensity and coherence of motifs in weighted complex networks
• Universal and non-universal properties of cross-correlations in financial time series
• Weight-conserving characterization of complex functional brain networks
• Generalizations of the clustering coefficient to weighted complex networks
• The statistical mechanics of networks
• Topology of correlation based minimal spanning trees in real and model markets
• Prominence and control: The weighted rich-club effect
• Entropy measures for complex networks: Toward an information theory of complex topologies
• The entropy of network ensembles
• The entropy of randomized network ensembles
• Analytical maximum-likelihood method to detect patterns in real networks
• Generalized Bose-Fermi statistics and structural correlations in weighted networks
• Community detection for correlation matrices
• Energy landscape analysis of neuroimaging data
• Clustering coefficients for correlation networks
• A topological criterion for filtering information in complex brain networks
• Correlations in weighted networks
• Enhanced reconstruction of weighted networks from strengths and degrees
• Scale-free Network in Financial Correlations
• Unbiased sampling of network ensembles
• Core-periphery structure requires something else in the network
• Rich-club vs rich-multipolarization phenomena in weighted networks
• Estimating topological properties of weighted networks from limited information
• A GDP-driven model for the binary and weighted structure of the International Trade Network

Cited by in corpus (8)

• Introduction to correlation networks: Interdisciplinary approaches beyond thresholding
• Gene communities in co-expression networks across different tissues
• Constructing networks by filtering correlation matrices: A null model approach
• Maximum Entropy approach to multivariate time series randomization
• Spontaneous back-pain alters randomness in functional connections in large scale brain networks: A random matrix perspective
• Simplicial persistence of financial markets: filtering, generative processes and portfolio risk
• Assessing imbalance in signed brain networks
• Sector Neutral Portfolios: Long memory motifs persistence in market structure dynamics