Sharp lower and upper bounds for the Gaussian rank of a graph (Q2350060)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Sharp lower and upper bounds for the Gaussian rank of a graph	scientific article

Statements

scholarly article

Sharp lower and upper bounds for the Gaussian rank of a graph (English)

Emanuel Ben-David

Journal of Multivariate Analysis

publication date

18 June 2015

full work available at URL

https://arxiv.org/abs/1406.4777

zbMATH Keywords

Gaussian graphical models

maximum likelihood estimation

tree-width

connectivity number

degeneracy number

random graphs

symmetric graphs

MaRDI profile type

MaRDI publication profile

Covariance selection for nonchordal graphs via chordal embedding

The non-singularity of generalized sample covariance matrices

Positive definite completions of partial Hermitian matrices

The maximum likelihood threshold of a graph

Handbook of Graph Theory

Orthogonal representations and connectivity of graphs

A correction: Orthogonal representations and connectivity of graphs

Statistical and algebraic independence

On the treewidth of dynamic graphs

Gaussian Markov distributions over finite graphs

Geometry of maximum likelihood estimation in Gaussian graphical models

Graphs with magnetic Schrödinger operators of low corank

The Schur complement and its applications

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:2350060

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2350060&oldid=35481939"