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
|
समान संसाधन
-
Covering the Edges of a Random Hypergraph by Cliques
द्वारा: Rödl Vojtěch, और अन्य
प्रकाशित: (2022-11-01) -
Edge intersection hypergraphs
द्वारा: Martin Sonntag, और अन्य
प्रकाशित: (2024-01-01) -
Critical random hypergraphs: The emergence of a giant set of identifiable vertices
द्वारा: Goldschmidt, C
प्रकाशित: (2005) -
Monochromatic Edges in Complete Multipartite Hypergraphs
द्वारा: Teeradej Kittipassorn, और अन्य
प्रकाशित: (2022-07-01) -
Node and edge nonlinear eigenvector centrality for hypergraphs
द्वारा: Francesco Tudisco, और अन्य
प्रकाशित: (2021-09-01)