The Triangle Friendship Paradox
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918081362657280 |
|---|---|
| author | Bhattacharya, Bishakh Gadhiwala, Nitya Hollander, Frank den Jain, Pradeeptha R Subramanya, Tejashree |
| author_facet | Bhattacharya, Bishakh Gadhiwala, Nitya Hollander, Frank den Jain, Pradeeptha R Subramanya, Tejashree |
| contents | We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges at a vertex, the average friendship-bias of the number of triangles at a vertex is not always non-negative. We identify classes of finite deterministic graphs for which the bias is non-negative, and provide examples of finite deterministic graphs for which it is not. For certain classes of sparse and dense random graphs, we compute the scaling of the bias in the limit as the number of vertices tends to infinity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02627 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Triangle Friendship Paradox Bhattacharya, Bishakh Gadhiwala, Nitya Hollander, Frank den Jain, Pradeeptha R Subramanya, Tejashree Probability We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges at a vertex, the average friendship-bias of the number of triangles at a vertex is not always non-negative. We identify classes of finite deterministic graphs for which the bias is non-negative, and provide examples of finite deterministic graphs for which it is not. For certain classes of sparse and dense random graphs, we compute the scaling of the bias in the limit as the number of vertices tends to infinity. |
| title | The Triangle Friendship Paradox |
| topic | Probability |
| url | https://arxiv.org/abs/2507.02627 |