Using PageRank to Characterize Web Structure

@article{Pandurangan2006UsingPT,
  title={Using PageRank to Characterize Web Structure},
  author={Gopal Pandurangan and Prabhakar Raghavan and Eli Upfal},
  journal={Internet Mathematics},
  year={2006},
  volume={3},
  pages={1 - 20}
}
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" properties of the web graph, we study the distribution of PageRank values on the web. Our measurements suggest that PageRank values on the web follow a power law. We then develop generative models for the web graph that explain this observation and moreover remain faithful to previously studied degree distributions. We analyze… 
View on Taylor & Francis
internetmathematicsjournal.com
149 Citations
Highly Influential Citations
8
Background Citations
35
Methods Citations
9
Results Citations
9

149 Citations

Citation Type

Citation Type

Asymptotic analysis for personalized Web search
TLDR
This paper model the PageRank as a solution of a stochastic equation where the R i s are distributed as R and obtains the asymptotic behavior of R under quite general assumptions on the involved random variables.
Stochastic analysis of web page ranking
TLDR
This thesis presents a new methodology for analyzing the probabilistic behavior of the PageRank distribution and the dependence between various power law parameters of the Web, based on the techniques from the theory of regular variations and the extreme value theory.
PageRank of Scale-Free Growing Networks
TLDR
An analytical expression is found for the expected PageRank value in a scale-free growing network model as a function of the age of the growing network and theAge of a particular node and it is shown that PageRank follows closely a power law in the middle range of its values.
Using SiteRank for P 2 P Web Retrieval
TLDR
It is concluded that the decomposition of global Web document ranking computation by making use of SiteRank is a very promising approach for computing global document rankings in a decentralized P2P search system.
Simulating the Webgraph: a comparative analysis of models
TLDR
This work simulated several of these models and compared them against a 300-million-node sample of the Webgraph provided by the Stanford WebBase project, finding that the more random the model, the better the graph.
Structuring the Web to Cope with Dynamic Changes
TLDR
The view of the web structure is formalized in terms of the integer linear programming that converts the web directed graph to the optimal hierarchical structure to represent a high level structure regardless of various measures such as the cosine similarity and tf-idf measure of the vector space model.
The Web as a graph: How far we are
TLDR
A large crawl from 2001 of 200M pages and about 1.4 billion edges, made available by the WebBase project at Stanford is studied, as well as several synthetic ones generated according to various models proposed recently, to investigate several topological properties of webgraphs.
The Static Absorbing Model for the Web
TLDR
The Absorbing Model is presented, a hyperlink analysis model based on absorbing Markov chains, where the Web graph is transformed by adding one absorbing state for each document, and it is shown that the latter is more effective than the authority-oriented model.
PageRank Asymptotics on Directed Preferential Attachment Networks
We characterize the tail behavior of the distribution of the PageRank of a uniformly chosen vertex in a directed preferential attachment graph and show that it decays as a power law with an explicit…
Representing and Quantifying Rank - Change for the Web Graph
TLDR
This paper addresses the issue of representing and quantifying web ranking trends as a measure of web pages, and proposes normalized measures of ranking trends that are comparable among web graph snapshots of different sizes.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
The Web as a Graph: Measurements, Models, and Methods
TLDR
This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet.
Graph structure in the Web
A stochastic model for the evolution of the Web
The PageRank Citation Ranking : Bringing Order to the Web
TLDR
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
A random graph model for massive graphs
TLDR
A random graph model is proposed which is a special case of sparse random graphs with given degree sequences which involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs.
Self-similarity in the web
TLDR
An extensive characterization of the graph structure of the Web is presented, with a view to enabling high-performance applications that make use of this structure and to optimized algorithm design for Web-scale data analysis.
Scale-free characteristics of random networks: the topology of the world-wide web
Inferring Web communities from link topology
TLDR
This investigation shows that although the process by which users of the Web create pages and links is very difficult to understand at a “local” level, it results in a much greater degree of orderly high-level structure than has typically been assumed.
The Diameter of a Scale-Free Random Graph
We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of earlier vertices, where each earlier vertex is chosen with probability…
Deeper Inside PageRank
TLDR
A comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model, and suggested alternatives to the traditional solution methods.
...
1
2
3
4
...