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...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Russian Academy of Sciences, Ivannikov Institute for System Programming
2018-10-01
|
| Serie: | Труды Института системного программирования РАН |
| Soggetti: | |
| Accesso online: | https://ispranproceedings.elpub.ru/jour/article/view/427 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|