Cargando…
A physical model for efficient ranking in networks
We present a physically inspired model and an efficient algorithm to infer hierarchical rankings of nodes in directed networks. It assigns real-valued ranks to nodes rather than simply ordinal ranks, and it formalizes the assumption that interactions are more likely to occur between individuals with...
Autores principales: | De Bacco, Caterina, Larremore, Daniel B., Moore, Cristopher |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
American Association for the Advancement of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6054508/ https://www.ncbi.nlm.nih.gov/pubmed/30035220 http://dx.doi.org/10.1126/sciadv.aar8260 |
Ejemplares similares
-
The interplay between ranking and communities in networks
por: Iacovissi, Laura, et al.
Publicado: (2022) -
Principled network extraction from images
por: Baptista, Diego, et al.
Publicado: (2021) -
Multicommodity routing optimization for engineering networks
por: Lonardi, Alessandro, et al.
Publicado: (2022) -
Systematic inequality and hierarchy in faculty hiring networks
por: Clauset, Aaron, et al.
Publicado: (2015) -
The ground truth about metadata and community detection in networks
por: Peel, Leto, et al.
Publicado: (2017)