On the upper tail problem for random hypergraphs
© 2020 Wiley Periodicals LLC The upper tail problem in a random graph asks to estimate the probability that the number of copies of some fixed subgraph in an Erdős-Rényi random graph exceeds its expectation by some constant factor. There has been much exciting recent progress on this problem. We stu...
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Wiley
2021
|
| 在线阅读: | https://hdl.handle.net/1721.1/133302 |