Probabilistic Relation between In-Degree and PageRank
Authors:
- 12 August 2008
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 72-83
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Monte Carlo Methods in PageRank Computation: When One Iteration is SufficientSIAM Journal on Numerical Analysis, 2007
- The distribution of pageRank follows a power-law only for particular values of the damping factor2006
- A Survey on PageRank ComputingInternet Mathematics, 2005
- Large scale properties of the WebgraphThe European Physical Journal B, 2004
- Deeper Inside PageRankInternet Mathematics, 2004
- Stochastic Networks and Queues2003
- Using PageRank to Characterize Web StructureLecture Notes in Computer Science, 2002
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998
- On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1Journal of Applied Probability, 1980
- Asymptotic properties of supercritical branching processes I: The Galton-Watson processAdvances in Applied Probability, 1974