On the edges’ PageRank and line graphs
DOI:
10.1063/1.5020127
Datum:
2018
Zusammenfassung
Two different approaches on a directed (and possibly weighted) network G are considered in order to define the PageRank of each edge of G with the focus on its applications. It is shown that both approaches are equivalent, even though it is clear that one approach has clear computational advantages over the other. The usefulness of this concept in the context of applications is illustrated by means of some examples within the area of cybersecurity and some simulations and examples within the scope of subway networks.
Colecciones
- Artículos de Revista [3696]
Herramientas
https://eciencia.urjc.es/themes/Mirage2/lib/js/urjc.js
Estadísticas
BenutzungsstatistikCitas
Los ítems de digital-BURJC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario