The Markov basis of K_(3,N)
classification
🧮 math.AC
math.STstat.TH
keywords
markovbasisexplainsarxivbasesbinarybipartitecomplete
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.