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)