2014
DOI: 10.48550/arxiv.1405.7832
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Robustness of journal rankings by network flows with different amounts of memory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…When going from rankings based on counting links to measuring the average visit frequency of a random walker on a standard network, i.e., calculating the PageRank 6 , the importance of neighbours becomes evident. Similarly, when going to PageRank on a network with second-order memory, the amount of flow received from neighbours also depends on the flow's origin 15,48 . We define a generalized secondorder PageRank as the stationary solution of ( 6)…”
Section: P( #"mentioning
confidence: 99%
“…When going from rankings based on counting links to measuring the average visit frequency of a random walker on a standard network, i.e., calculating the PageRank 6 , the importance of neighbours becomes evident. Similarly, when going to PageRank on a network with second-order memory, the amount of flow received from neighbours also depends on the flow's origin 15,48 . We define a generalized secondorder PageRank as the stationary solution of ( 6)…”
Section: P( #"mentioning
confidence: 99%