arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0308280math.COmath.ACmath.STstat.TH

Markov bases of binary graph models

Mike Develin, Seth Sullivant

英文摘要:

This paper is concerned with the topological invariant of a graph given by the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We describe a degree four Markov basis for the model when the underlying graph is a cycle and generalize this result to the complete bipartite graph $K_{2,n}$. We also give a combinatorial classification of degree two and three Markov basis moves as well as a Buchberger-free algorithm to compute moves of arbitrary given degree. Finally, we compute the algebraic degree of the model when the underlying graph is a forest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑