Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

JCT
2007

favoriteEmaildiscussreport

83views more JCT 2007»

A finiteness theorem for Markov bases of hierarchical models

13 years 4 months ago

A finiteness theorem for Markov bases of hierarchical models

Download www.aimath.org

We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is greater than a computable bound, the Markov bases consist of elements from Markov bases of smaller tables. We give an explicit formula for this bound in terms of Graver bases. We also compute these Markov and Graver complexities for all K × 2 × 2 × 2 tables.

Serkan Hosten, Seth Sullivant

Real-time Traffic

JCT 2007 | Markov Bases | Single Table Dimension | Table Dimension |

claim paper

Related Content

» Recurrence Plots for Symbolic Sequences

» New Results on SingleStep Power Control System in Finite State Markov Channel Power Contro...

» The Infinite Hidden Markov Model

» Imitation Learning of Teamplay in Multiagent System based on Hidden Markov Modeling

» A FiniteState Markov Chain Model for Statistical Loss Across a RED Queue

» Hierarchical Hidden Markov Models for Information Extraction

» A Hierarchical Markov Random Field Model for FigureGround Segregation

» Hierarchical Hidden Markov Model for Rushes Structuring and Indexing

» Predicting protein subcellular locations using hierarchical ensemble of Bayesian classifie...

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Serkan Hosten, Seth Sullivant

Comments (0)