Analysis of size of the largest dense subgraph of random hypergraph
| Autor: | N. N. Kuzyrin, D. O. Lazarev |
|---|---|
| Jazyk: | English<br />Russian |
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Труды Института системного программирования РАН, Vol 29, Iss 6, Pp 213-220 (2018) |
| Druh dokumentu: | article |
| ISSN: | 2079-8156 2220-6426 |
| DOI: | 10.15514/ISPRAS-2017-29(6)-12 |
| Popis: | 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 surely c-dense; the upper and lower bounds for the size of maximal -dense subgraph almost surely included in were determined; in case when , the upper bound for the maximal size of c-dense subgraph almost surely included in was attained. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|