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...
Príomhchruthaitheoirí: | Goldschmidt, C, Norris, J |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
2004
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Covering the Edges of a Random Hypergraph by Cliques
de réir: Rödl Vojtěch, et al.
Foilsithe / Cruthaithe: (2022-11-01) -
Edge intersection hypergraphs
de réir: Martin Sonntag, et al.
Foilsithe / Cruthaithe: (2024-01-01) -
Critical random hypergraphs: The emergence of a giant set of identifiable vertices
de réir: Goldschmidt, C
Foilsithe / Cruthaithe: (2005) -
Monochromatic Edges in Complete Multipartite Hypergraphs
de réir: Teeradej Kittipassorn, et al.
Foilsithe / Cruthaithe: (2022-07-01) -
Node and edge nonlinear eigenvector centrality for hypergraphs
de réir: Francesco Tudisco, et al.
Foilsithe / Cruthaithe: (2021-09-01)