Timeline for PageRank for a Non-Random Searcher
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 23, 2011 at 9:33 | vote | accept | Fomite | ||
| Aug 15, 2011 at 21:02 | comment | added | Fomite | There are a number of unreachable "rank source" nodes in the network, but why is it necessarily bad for them to have 0 rank. If what you're interested in is the relative scale of "A is more important than B", why do nodes need to have a positive rank? There's a single rank sink, but I'm less worried about it's rank being stable, as its an artificial construct that's there to let you calculate betweenness centrality. | |
| Aug 15, 2011 at 17:03 | comment | added | Huck Bennett | If a vertex has no incoming edges (is a rank source), then it will be unreachable and have 0 rank. If a vertex has no outgoing edges (is a rank sink), then rank will not be conserved in subsequent iterations. I.e., a vertex being weakly (but not strongly) connected causes problems; it doesn't have to be isolated. | |
| Aug 15, 2011 at 17:02 | history | edited | Mahdi Cheraghchi | CC BY-SA 3.0 |
added 96 characters in body
|
| Aug 15, 2011 at 16:26 | history | answered | Mahdi Cheraghchi | CC BY-SA 3.0 |