Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence

HIGHLIGHTS

• What: The authors propose a Parallel Tempering method where the hypothetical energy of the hypergraphs measures the deviation from the prescribed degree sequence. The authors propose an approach that is restricted to the realm of simple hypergraphs. As the authors show in this paper, it is NP-complete to decide if a partite, 3-uniform hypergraph exists with a given degree sequence, and randomly generating one such a hypergraph does not seem to be an easier computational problem. The authors show in this paper that the decision and the construction problem is easy if one of the . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.