Tree cumulants and the geometry of binary tree models
From MaRDI portal
Abstract: In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on the theory of partially ordered sets allows us to obtain a convenient parametrization of this model class. The construction of the proposed coordinate system mirrors the combinatorial definition of cumulants. A simple product-like form of the resulting parametrization gives insight into identifiability issues associated with this model class. In particular, we provide necessary and sufficient conditions for such a model to be identified up to the switching of labels of the inner nodes. When these conditions hold, we give explicit formulas for the parameters of the model. Whenever the model fails to be identified, we use the new parametrization to describe the geometry of the unidentified parameter space. We illustrate these results using a simple example.
Recommendations
Cites work
- scientific article; zbMATH DE number 5957252 (Why is no real title available?)
- scientific article; zbMATH DE number 45789 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- A note on relationships between moments, central moments and cumulants from multivariate distributions
- Bayesian analysis in expert systems. With comments and a rejoinder by the authors
- CUMULANTS AND PARTITION LATTICES1
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Geometry, moments and conditional independence trees with hidden variables.
- Identifiability of parameters in latent structure models with many observed variables
- Multiplicative functions on the lattice of non-crossing partitions and free convolution
- On the combinatorics of cumulants
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Peeling phylogenetic `oranges'
- Stratified exponential families: Graphical models and model selection
- Structuring causal trees
Cited in
(19)- On identifying tree-structured perfect maps
- Power-law behavior in geometric characteristics of full binary trees
- The Geometry of Causal Probability Trees that are Algebraically Constrained
- Implicit inequality constraints in a binary tree model
- The moments of Wishart laws, binary trees, and the triple products
- Wald tests of singular hypotheses
- Tree topologies along a tropical line segment
- The curved exponential family of a staged tree
- scientific article; zbMATH DE number 6484043 (Why is no real title available?)
- Identification of discrete concentration graph models with one hidden binary variable
- An algebraic analysis of the two state Markov model on tripod trees
- Gaussian tree constraints applied to acoustic linguistic functional data
- \(L\)-cumulants, \(L\)-cumulant embeddings and algebraic statistics
- Information geometry for phylogenetic trees
- Hierarchical models as marginals of hierarchical models
- Statistical Properties of Loss Rate Estimators in Tree Topology
- Geometry, moments and conditional independence trees with hidden variables.
- On Locality in a Geometric Random Tree Model
- Parameter estimation in topological analysis of binary tree structures
This page was built for publication: Tree cumulants and the geometry of binary tree models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408105)
