Generation of positiv definite matrices with constraints to validate network algorithms for micro array data.

MaRDI QIDQ3549498zbMATH OpenFDO

Authors Markus Ruschhaupt

Publication date 30 December 2008

Full work available at URL http://edoc.ub.uni-muenchen.de/8653/

zbMATH Keywords

micro array datapremoralisable graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Applications of statistics to biology and medical sciences; meta analysis (62P10) Research exposition (monographs, survey articles) pertaining to biology (92-02) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• On generating random Gaussian graphical models
• Generating valid \(4\times4\) correlation matrices
• Positive definite completion problems for Bayesian networks
• Generating random correlation matrices with fixed values: an application to the evaluation of multivariate surrogate endpoints
• A robust procedure for Gaussian graphical model search from microarray data with p larger than n

Describes a project that uses

Uses Software

• graph
• rda

This page was built for publication: Generation of positiv definite matrices with constraints to validate network algorithms for micro array data.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549498)