A model for efficient dynamical ranking in networks
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914967278583808 |
|---|---|
| author | Della Vecchia, Andrea Neocosmos, Kibidi Larremore, Daniel B. Moore, Cristopher De Bacco, Caterina |
| author_facet | Della Vecchia, Andrea Neocosmos, Kibidi Larremore, Daniel B. Moore, Cristopher De Bacco, Caterina |
| contents | We present a physics-inspired method for inferring dynamic rankings in directed temporal networks - networks in which each directed and timestamped edge reflects the outcome and timing of a pairwise interaction. The inferred ranking of each node is real-valued and varies in time as each new edge, encoding an outcome like a win or loss, raises or lowers the node's estimated strength or prestige, as is often observed in real scenarios including sequences of games, tournaments, or interactions in animal hierarchies. Our method works by solving a linear system of equations and requires only one parameter to be tuned. As a result, the corresponding algorithm is scalable and efficient. We test our method by evaluating its ability to predict interactions (edges' existence) and their outcomes (edges' directions) in a variety of applications, including both synthetic and real data. Our analysis shows that in many cases our method's performance is better than existing methods for predicting dynamic rankings and interaction outcomes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_13544 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A model for efficient dynamical ranking in networks Della Vecchia, Andrea Neocosmos, Kibidi Larremore, Daniel B. Moore, Cristopher De Bacco, Caterina Physics and Society Machine Learning Social and Information Networks Data Analysis, Statistics and Probability We present a physics-inspired method for inferring dynamic rankings in directed temporal networks - networks in which each directed and timestamped edge reflects the outcome and timing of a pairwise interaction. The inferred ranking of each node is real-valued and varies in time as each new edge, encoding an outcome like a win or loss, raises or lowers the node's estimated strength or prestige, as is often observed in real scenarios including sequences of games, tournaments, or interactions in animal hierarchies. Our method works by solving a linear system of equations and requires only one parameter to be tuned. As a result, the corresponding algorithm is scalable and efficient. We test our method by evaluating its ability to predict interactions (edges' existence) and their outcomes (edges' directions) in a variety of applications, including both synthetic and real data. Our analysis shows that in many cases our method's performance is better than existing methods for predicting dynamic rankings and interaction outcomes. |
| title | A model for efficient dynamical ranking in networks |
| topic | Physics and Society Machine Learning Social and Information Networks Data Analysis, Statistics and Probability |
| url | https://arxiv.org/abs/2307.13544 |