The Minimization of Random Hypergraphs

30 Oct 2020 Bläsius Thomas Friedrich Tobias Schirneck Martin

We investigate the maximum-entropy model $\mathcal{B}_{n,m,p}$ for random $n$-vertex, $m$-edge multi-hypergraphs with expected edge size $pn$. We show that the expected size of the minimization of $\mathcal{B}_{n,m,p}$, i.e., the number of its inclusion-wise minimal edges, undergoes a phase transition with respect to $m$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISCRETE MATHEMATICS
  • DATA STRUCTURES AND ALGORITHMS
  • COMBINATORICS
  • PROBABILITY