Graver basis for an undirected graph and its application to testing the beta model of random graphs

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.

References in corpus (3)

• The structure and function of complex networks
• The statistical mechanics of networks
• Minimal generators of toric ideals of graphs

Cited by in corpus (1)

• Toric algebra of hypergraphs