Generalization of the PageRank Model
Social and Information Networks
2014-01-21 v1 Information Retrieval
Abstract
This paper develops a generalization of the PageRank model of page centralities in the global webgraph of hyperlinks. The webgraph of adjacencies is generalized to a valued directed graph, and the scalar dampening coefficient for walks through the graph is relaxed to allow for heterogeneous values. A visitation count approach may be employed to apply the more general model, based on the number of visits to a page and the page's proportionate allocations of these visits to other nodes of the webgraph.
Keywords
Cite
@article{arxiv.1401.4740,
title = {Generalization of the PageRank Model},
author = {Noah E. Friedkin},
journal= {arXiv preprint arXiv:1401.4740},
year = {2014}
}