scientific article; zbMATH DE number 7626718
From MaRDI portal
Publication:5053191
Vasiliki Velona, Jakub Truszkowski, Piotr Zwiernik, Gábor Lugosi
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/1906.09501
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating sparse precision matrix: optimal rates of convergence and adaptive estimation
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Trek separation for Gaussian graphical models
- Causation, prediction, and search
- A partial k-arboretum of graphs with bounded treewidth
- A note on the bounded fragmentation property and its applications in network reliability
- The Schur complement and its applications
- High-dimensional semiparametric Gaussian copula graphical models
- Dependence in elliptical partial correlation graphs
- Marginalization and collapsibility in graphical interaction models
- Mean estimation and regression under heavy-tailed distributions: A survey
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Learning a Bounded-Degree Tree Using Separator Queries
- Maximal biconnected subgraphs of random planar graphs
- Finding small balanced separators
- The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
- Fast Error-Tolerant Quartet Phylogeny Algorithms
- Graphical Models with R
- Model selection and estimation in the Gaussian graphical model
- Graphical Models, Exponential Families, and Variational Inference
- Complexity of Finding Embeddings in a k-Tree
- Stability Selection
- An Experimental Study of the Treewidth of Real-World Graph Data
- Computational and statistical tradeoffs via convex relaxation
- Latent tree models
- Approximating discrete probability distributions with dependence trees
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Combinatorial methods in density estimation
