Generating Correlation Matrices with Graph Structures Using Convex Optimization
This work deals with the generation of theoretical correlation matrices with specific sparsity patterns, associated to graph structures. We present a novel approach based on convex optimization, offering greater flexibility compared to existing techniques, notably by controlling the mean of the entry distribution in the generated correlation matrices. This allows for the generation of correlation matrices that better represent realistic data and can be used to benchmark statistical methods for graph inference.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
G{é}n{é}ration de Matrices de Corr{é}lation avec des Structures de Graphe par Optimisation Convexe
This work deals with the generation of theoretical correlation matrices with specific sparsity patterns, associated to graph structures. We present a novel approach based on convex optimization, offering greater flexibil…
A New Method for Generating Random Correlation Matrices
We propose a new method for generating random correlation matrices that makes it simple to control both location and dispersion. The method is based on a vector parameterization, gamma = g(C), which maps any distribution…
Coarse graining correlation matrices according to macrostructures: Financial markets as a paradigm
We analyze correlation structures in financial markets by coarse graining the Pearson correlation matrices according to market sectors to obtain Guhr matrices using Guhr's correlation method according to Ref. [P. Rinn {\…
Phase Transition in Convex Relaxations for Graph Alignment
We study the graph alignment problem for correlated Gaussian Orthogonal Ensemble (GOE) matrices, where the goal is to recover a hidden vertex permutation given two correlated symmetric Gaussian matrices $(A, B)$ with cor…
A Unified Framework for Structure-Aware Clustering and Heterogeneous Causal Graph Learning
In complex multivariate systems, interactions among variables are defined by dependency structures, often encoded as directed acyclic graphs ($\text{DAGs}$). However, dependency structures can vary across subjects, and i…
Graph Learning