Markov bases of binary graph models

Details Markov bases of binary graph models Markov bases of binary graph models

2003-08-28

arxiv.org/abs/math/0308280v1

Mathematics

Combinatorics

24 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Markov bases of binary graph models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Markov bases of binary graph models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Markov bases of binary graph models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-340932