Markov degree of configurations defined by fibers of a configuration
Algebraic Statistics
Markov basis
Transportation polytopes
We consider a series of configurations defined by fibers of a given base configuration. We prove that Markov degree of the configurations is bounded from above by the Markov complexity of the base configuration. As important examples of base configurations we consider incidence matrices of graphs and study the maximum Markov degree of configurations defined by fibers of the incidence matrices. In particular we give a proof that the Markov degree for two-way transportation polytopes is three.
Koyama, Takayuki
Ogawa, Mitsunori
Takemura, Akimichi
2015
2015-11-09
Article
application/pdf
islandora:1007808
https://doi.org/10.18409/jas.v6i2.38
http://hdl.handle.net/10560/islandora:1007808
MATH / Applied Mathematics
Illinois Institute of Technology
Journal of Algebraic Statistics
en (english)
Open Access