Traditional and Lazy PageRanks for a line of nodes connected with complete graphs (Q2329123)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Traditional and Lazy PageRanks for a line of nodes connected with complete graphs |
scientific article |
Statements
Traditional and Lazy PageRanks for a line of nodes connected with complete graphs (English)
0 references
17 October 2019
0 references
random walk
0 references
PageRank
0 references
Lazy PageRank
0 references
