Discrete statistical models supported on labeled event trees can be specified using so-called interpolating polynomials which are generalizations of generating functions. These admit a nested representation which is a notion formalized in this paper. A new algorithm exploits the primary decomposition of monomial ideals associated with an interpolating polynomial to quickly compute all nested representations of that polynomial. It hereby determines an important subclass of all trees representing the same statistical model. To illustrate this method we analyze the full polynomial equivalence class of a staged tree representing the best fitting model inferred from a real-world dataset.
Discovery of statistical equivalence classes using computer algebra
Bigatti, Anna;Riccomagno, Eva;
2018-01-01
Abstract
Discrete statistical models supported on labeled event trees can be specified using so-called interpolating polynomials which are generalizations of generating functions. These admit a nested representation which is a notion formalized in this paper. A new algorithm exploits the primary decomposition of monomial ideals associated with an interpolating polynomial to quickly compute all nested representations of that polynomial. It hereby determines an important subclass of all trees representing the same statistical model. To illustrate this method we analyze the full polynomial equivalence class of a staged tree representing the best fitting model inferred from a real-world dataset.File | Dimensione | Formato | |
---|---|---|---|
Review_bigattigoergenriccomagnosmith_IJAR.pdf
Open Access dal 01/01/2023
Tipologia:
Documento in Pre-print
Dimensione
365.55 kB
Formato
Adobe PDF
|
365.55 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.