ISSN 1944-9488
Vol. 4, Issue 2, 2007December 31, 2006 EDT
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
Articles in Vol. 4, Issue 2, 2007
Vol. 4, Issue 2, 2007
- Expansion and Lack Thereof in Randomly Perturbed GraphsAbraham D. Flaxman
- Learning to Rank in Vector Spaces and Social NetworksSoumen Chakrabarti
- Infinite Limits and Adjacency Properties of a Generalized Copying ModelJeannette JanssenAnthony Bonato
- In-Degree and PageRank: Why Do They Follow Similar Power Laws?W. R. W. ScheinhardtY. VolkovichN. Litvak
- On Local Estimations of PageRank: A Mean Field ApproachMarián BoguñáAlessandro FlamminiFilippo MenczerSanto Fortunato
- On Locality in a Geometric Random Tree ModelRoss M. Richardson
- The Spectral Gap of a Random Subgraph of a GraphFan ChungPaul Horn
Scheinhardt, W. R. W., Y. Volkovich, and N. Litvak. 2007. “In-Degree and PageRank: Why Do They Follow Similar Power Laws?” Internet Mathematics 4 (2). https://doi.org/10.1080/15427951.2007.10129293.