Random Hypergraphs

Random Hypergraphs is a probabilistic model of hypergraphs in which hyperedges are generated according to a specified probability distribution, distinguishing it from deterministic hypergraph constructions by incorporating randomness in the presence or structure of hyperedges.

136

Publications

4.9K

Citations

191

Authors

146

Institutions

Publications per year

2017–2026

43

Authors

191

  1. AF
    Alan Frieze

    Carnegie Mellon University, United States

    9 publications · 280 citations

    9

    h-index

  2. FC
    Fan Chung

    University of California San Diego, United States

    6 publications · 400 citations

    6

    h-index

  3. DA
    D. A. Shabanov

    Lomonosov Moscow State University, Russia

    4 publications · 68 citations

    4

    h-index

  4. MK
    Mihyun Kang

    Graz University of Technology, Austria

    4 publications · 77 citations

    4

    h-index

  5. YP
    Yury Person

    Freie Universität Berlin, Germany

    3 publications · 54 citations

    3

    h-index

1–5 of 191

Venues

  1. Random Structures and Algorithms

    30 publications · 1.1K citations

    21

    h-index

  2. arXiv (Cornell University)

    Repository · 8 publications · 158 citations

    8

    h-index

  3. Combinatorics Probability Computing

    6 publications · 169 citations

    6

    h-index

  4. The Electronic Journal of Combinatorics

    4 publications · 117 citations

    4

    h-index

  5. Journal of Combinatorial Theory Series B

    4 publications · 91 citations

    4

    h-index

1–5