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)