scientific article; zbMATH DE number 7626718
From MaRDI portal
Publication:5053191
Authors: Jakub Truszkowski, Vasiliki Velona, Piotr Zwiernik, Gábor Lugosi 
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/1906.09501
Title of this publication is not available (Why is that?)
Cites Work
- Causation, prediction, and search
- Graphical models, exponential families, and variational inference
- Stability Selection
- High-dimensional semiparametric Gaussian copula graphical models
- The nonparanormal: semiparametric estimation of high dimensional undirected graphs
- The Schur complement and its applications
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Graphical models with R.
- Model selection and estimation in the Gaussian graphical model
- Title not available (Why is that?)
- Approximating discrete probability distributions with dependence trees
- Causality. Models, reasoning, and inference
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Trek separation for Gaussian graphical models
- Estimating sparse precision matrix: optimal rates of convergence and adaptive estimation
- The necessity of bounded treewidth for efficient inference in Bayesian networks
- A partial k-arboretum of graphs with bounded treewidth
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- Combinatorial methods in density estimation
- Learning Markov networks: Maximum bounded tree-width graphs
- Computational and statistical tradeoffs via convex relaxation
- Fast error-tolerant quartet phylogeny algorithms
- Maximal biconnected subgraphs of random planar graphs
- A \(c^k n\) 5-approximation algorithm for treewidth
- Finding small balanced separators
- Latent tree models
- Marginalization and collapsibility in graphical interaction models
- An Experimental Study of the Treewidth of Real-World Graph Data
- A note on the bounded fragmentation property and its applications in network reliability
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Mean estimation and regression under heavy-tailed distributions: A survey
- Dependence in elliptical partial correlation graphs
- Learning a bounded-degree tree using separator queries
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053191)
