Learning latent tree models with small query complexity

DOI10.3150/25-BEJ1921MaRDI QIDQ7347124zbMATH OpenFDO

Authors Luc Devroye, Gábor Lugosi, Piotr Zwiernik

Publication date 14 September 2026

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/bernoulli/volume-32/issue-4/Learning-latent-tree-models-with-small-query-complexity/10.3150/25-BEJ1921.full

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Epidemiology (92D30)

Cites work

• A fast algorithm for constructing trees from distance matrices
• A note on the metric properties of trees
• A novel document generation process for topic detection based on hierarchical latent tree models
• A survey on latent tree models and applications
• Algorithms on Strings, Trees and Sequences
• An algorithm for tree-realizability of distance matrices^∗
• An optimal algorithm to reconstruct trees from additive distance data
• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
• Determining the Evolutionary Tree Using Experiments
• Distance matrix of a graph and its realizability
• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Hierarchical clustering with discrete latent variable models and the integrated classification likelihood
• Hierarchical latent class models for cluster analysis
• High-dimensional semiparametric Gaussian copula graphical models
• scientific article; zbMATH DE number 4145711 (Why is no real title available?)
• scientific article; zbMATH DE number 1303534 (Why is no real title available?)
• scientific article; zbMATH DE number 1304319 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 2079368 (Why is no real title available?)
• scientific article; zbMATH DE number 1754590 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• scientific article; zbMATH DE number 7651142 (Why is no real title available?)
• Learning latent tree graphical models
• Learning mixed latent tree models
• Mean estimation and regression under heavy-tailed distributions: A survey
• On the complexity of constructing evolutionary trees
• On the longest path algorithm for reconstructing trees from distance matrices
• Optimal phylogenetic reconstruction
• Properties of the distance matrix of a tree
• Spectral neighbor joining for reconstruction of latent tree models
• The correlation space of Gaussian latent tree models and model selection without fitting

This page was built for publication: Learning latent tree models with small query complexity

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