Graver basis for an undirected graph and its application to testing the beta model of random graphs
classification
🧮 math.ST
math.COstat.TH
keywords
basisbetagraphgraphsgravermodelrandomtesting
read the original abstract
In this paper we give an explicit and algorithmic description of Graver basis for the toric ideal associated with a simple undirected graph and apply the basis for testing the beta model of random graphs by Markov chain Monte Carlo method.
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.