Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909192968732672 |
|---|---|
| author | Bloznelis, Mindaugas Karjalainen, Joona Leskelä, Lasse |
| author_facet | Bloznelis, Mindaugas Karjalainen, Joona Leskelä, Lasse |
| contents | The clustering property of complex networks indicates the abundance of small dense subgraphs in otherwise sparse networks.
For a community-affiliation network defined by a superposition of Bernoulli random graphs, which has a nonvanishing global clustering coefficient and a power-law degree distribution, we establish normal and $α$--stable approximations to the number of small cliques, cycles and more general $2$-connected subgraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2107_02683 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs Bloznelis, Mindaugas Karjalainen, Joona Leskelä, Lasse Probability Social and Information Networks Combinatorics 60F05, 05C82, 91D30 The clustering property of complex networks indicates the abundance of small dense subgraphs in otherwise sparse networks. For a community-affiliation network defined by a superposition of Bernoulli random graphs, which has a nonvanishing global clustering coefficient and a power-law degree distribution, we establish normal and $α$--stable approximations to the number of small cliques, cycles and more general $2$-connected subgraphs. |
| title | Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs |
| topic | Probability Social and Information Networks Combinatorics 60F05, 05C82, 91D30 |
| url | https://arxiv.org/abs/2107.02683 |