Essential edges in Poisson random hypergraphs

Consider a random hypergraph on a set of N vertices in which, for 1 ≤ k ≤ N, a Poisson (Nβκ) number of hyperedges is scattered randomly over all subsets of size k. We collapse the hypergraph by running the following algorithm to exhaustion: Pick a vertex having a 1-edge and remove it; collapse the h...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों: Goldschmidt, C, Norris, J
स्वरूप: Journal article
भाषा:English
प्रकाशित: 2004

समान संसाधन