PageRank Computation, with Special Attention to Dangling Nodes (Q3537449)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: PageRank Computation, with Special Attention to Dangling Nodes |
scientific article; zbMATH DE number 5363087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PageRank Computation, with Special Attention to Dangling Nodes |
scientific article; zbMATH DE number 5363087 |
Statements
PageRank Computation, with Special Attention to Dangling Nodes (English)
0 references
6 November 2008
0 references
stochastic matrix
0 references
stationary distribution
0 references
lumping
0 references
rank-one matrix
0 references
power method
0 references
Jordan decomposition
0 references
similarity transformation
0 references
PageRank
0 references
Google matrix
0 references
algorithm
0 references
dangling nodes
0 references
0.906345784664154
0 references
0.8384612202644348
0 references
0.8324869871139526
0 references
0.8131017088890076
0 references
0.8109054565429688
0 references
