The Markov basis of K_3,N

2014/06/23 by Johannes Rauh, Rauh, Johannes, Seth Sullivant +1
Computer Science · Mathematics · #11P21 #13E15 #13P10 #52B20 #90C10 #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Commutative Algebra (math.AC) #FOS: Mathematics #Statistics Theory (math.ST) #Topological and Geometric Data Analysis #math.AC #math.ST #msc:11P21 #msc:13E15 #msc:13P10 #msc:52B20 #msc:90C10 #stat.TH

paper · pdf · doi:10.48550/arxiv.1406.5936

14 pages. An HTML version of this document is available at http://markov-bases.de/models/K3N/K3N.html

openalex publication_date 2014/06/23 · arxiv created 2014/06/26 · arxiv updated 2014/06/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This document explains how to obtain a Markov basis of the graphical model of the complete bipartite graph K_3,N with binary nodes. The computations illustrate the theory developed in arXiv:1404.6392 that explains how to compute Markov bases of toric fiber products.

Citations

• Lifting Markov Bases and Higher Codimension Toric Fiber Products

Related

• Markov bases of binary graph models
• Degree Bounds for a Minimal Markov Basis for the Three-State Toric Homogeneous Markov Chain Model
• Computing all minimal Markov bases in Macaulay2
• Markov bases of binary graph models of K₄-minor free graphs
• Lifting Markov Bases and Higher Codimension Toric Fiber Products