2008
DOI: 10.1007/s00208-008-0320-6
|View full text |Cite
|
Sign up to set email alerts
|

On the ideals of equivariant tree models

Abstract: We introduce equivariant tree models in algebraic statistics, which unify and generalise existing tree models such as the general Markov model, the strand symmetric model, and group-based models such as the Jukes-Cantor and Kimura models. We focus on the ideals of such models. We show how the ideals for general trees can be determined from the ideals for stars. A corollary of theoretical importance is that the ideal for a general tree is generated by the ideals of its flattenings at vertices. The main novelty … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
85
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 56 publications
(94 citation statements)
references
References 16 publications
1
85
0
Order By: Relevance
“…This was conjectured in [50, §7] and proved in [5] and in [65]. The DraismaKuttler theorem [36] can be regarded as a generalization of this statement.…”
Section: X1mentioning
confidence: 75%
See 1 more Smart Citation
“…This was conjectured in [50, §7] and proved in [5] and in [65]. The DraismaKuttler theorem [36] can be regarded as a generalization of this statement.…”
Section: X1mentioning
confidence: 75%
“…We here do not offer a formal definition of what "reasonable" means but refer to [36] instead. Let K 1,m denote the complete bipartite graph with one hidden node and m observed nodes.…”
Section: Secant Varieties In Statisticsmentioning
confidence: 99%
“…For very general, so-called equivariant models, the fact that on set-theoretic level there exists a bound was proved in [DK09,DK14,DE15]. For the class of G-models that includes all the models introduced in this article, on the level of projective schemes the bounds were obtained in [Mic13].…”
Section: Introductionmentioning
confidence: 99%
“…These trees, denoted by K 1,n have one inner vertex and n leaves. Let us cite Draisma and Kuttler [DK09]:…”
Section: Introductionmentioning
confidence: 99%
“…1. For other recent results about Sym(N)-Noetherian polynomial algebras see, for instance, articles [2,8,10,11,12] and a survey [7]. 2.…”
Section: Introductionmentioning
confidence: 99%