Analysis of size of the largest dense subgraph of random hypergraph
Random networks are often described using Erdos-Renyi model of random graph . The concept of graph density is often used in random network analysis. In this article, the maximal size of c-dense subgraph almost surely included in random graph was evaluated. It was shown, that if , then is almost sure...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
| Series: | Труды Института системного программирования РАН |
| Subjects: | |
| Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/427 |