An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept (Q2662531): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2020.125676 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3092147726 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multilayer Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A biplex approach to PageRank centrality: From classic to multiplex networks / rank | |||
Normal rank | |||
Latest revision as of 23:03, 24 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept |
scientific article |
Statements
An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept (English)
0 references
14 April 2021
0 references
PageRank
0 references
adapted PageRank algorithm
0 references
two-layers PageRank
0 references
APA biplex
0 references
multiplex centrality
0 references
multiplex networks
0 references
0 references
0 references
