Markov bases of binary graph models
| dc.creator | Develin, Mike | |
| dc.creator | Sullivant, Seth | |
| dc.date | 2003-08-28 | |
| dc.date.accessioned | 2026-07-07T08:06:10Z | |
| dc.date.available | 2026-07-07T08:06:10Z | |
| dc.description | 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. | |
| dc.description | 24 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0308280 | |
| dc.identifier | http://arxiv.org/abs/math/0308280 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130513 | |
| dc.subject | Combinatorics | |
| dc.subject | Commutative Algebra | |
| dc.subject | Statistics Theory | |
| dc.title | Markov bases of binary graph models | |
| dc.type | text |