On Exponential Random Graph Models with Dyadic Independence
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915358601904128 |
|---|---|
| author | Sadeghi, Kayvan |
| author_facet | Sadeghi, Kayvan |
| contents | We show that the only exponential random graph model with n nodal parameters, dyads being independent, and the natural assumption of permutation-equivariant nodal parametrization is the \b{eta} model. In addition, we show that an exponential random graph model with similar assumptions but with fewer than n block parameters is the additive stochastic block model. We also provide similar results for directed networks |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_20458 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Exponential Random Graph Models with Dyadic Independence Sadeghi, Kayvan Statistics Theory We show that the only exponential random graph model with n nodal parameters, dyads being independent, and the natural assumption of permutation-equivariant nodal parametrization is the \b{eta} model. In addition, we show that an exponential random graph model with similar assumptions but with fewer than n block parameters is the additive stochastic block model. We also provide similar results for directed networks |
| title | On Exponential Random Graph Models with Dyadic Independence |
| topic | Statistics Theory |
| url | https://arxiv.org/abs/2506.20458 |