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...
Glavni autori: | Goldschmidt, C, Norris, J |
---|---|
Format: | Journal article |
Jezik: | English |
Izdano: |
2004
|
Slični predmeti
-
Covering the Edges of a Random Hypergraph by Cliques
od: Rödl Vojtěch, i dr.
Izdano: (2022-11-01) -
Edge intersection hypergraphs
od: Martin Sonntag, i dr.
Izdano: (2024-01-01) -
Critical random hypergraphs: The emergence of a giant set of identifiable vertices
od: Goldschmidt, C
Izdano: (2005) -
Monochromatic Edges in Complete Multipartite Hypergraphs
od: Teeradej Kittipassorn, i dr.
Izdano: (2022-07-01) -
Node and edge nonlinear eigenvector centrality for hypergraphs
od: Francesco Tudisco, i dr.
Izdano: (2021-09-01)