Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2501.19220 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917907677577216 |
|---|---|
| author | Bonato, Anthony Walaa, Mariam |
| author_facet | Bonato, Anthony Walaa, Mariam |
| contents | The Common Out-Neighbor (or CON) score quantifies shared influence through outgoing links in competitive contexts. A dynamic analysis of competition networks reveals the CON score as a powerful predictor of node rankings. Defined in first-order and second-order forms, the CON score captures both direct and indirect competitive interactions, offering a comprehensive metric for evaluating node influence. Using datasets from Survivor, Chess.com, and Dota~2 online gaming competitions, directed competition networks are constructed, and the dynamic CON score is integrated into supervised machine learning models. Empirical results show that the CON score consistently outperforms traditional centrality measures such as PageRank, closeness, and betweenness centrality in classification tasks.
By integrating dynamic centrality measures with machine learning, our proposed methodology accurately predicts outcomes in competition networks. The findings underline the CON score's robustness as a feature in node classification, offering a significant advancement in understanding and analyzing competitive interactions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_19220 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Analysis and predictability of centrality measures in competition networks Bonato, Anthony Walaa, Mariam Social and Information Networks The Common Out-Neighbor (or CON) score quantifies shared influence through outgoing links in competitive contexts. A dynamic analysis of competition networks reveals the CON score as a powerful predictor of node rankings. Defined in first-order and second-order forms, the CON score captures both direct and indirect competitive interactions, offering a comprehensive metric for evaluating node influence. Using datasets from Survivor, Chess.com, and Dota~2 online gaming competitions, directed competition networks are constructed, and the dynamic CON score is integrated into supervised machine learning models. Empirical results show that the CON score consistently outperforms traditional centrality measures such as PageRank, closeness, and betweenness centrality in classification tasks. By integrating dynamic centrality measures with machine learning, our proposed methodology accurately predicts outcomes in competition networks. The findings underline the CON score's robustness as a feature in node classification, offering a significant advancement in understanding and analyzing competitive interactions. |
| title | Analysis and predictability of centrality measures in competition networks |
| topic | Social and Information Networks |
| url | https://arxiv.org/abs/2501.19220 |