Traditional PageRank versus Network Capacity Bound
Social and Information Networks
2017-02-14 v1
Abstract
In a former paper we simplified the proof of a theorem on personalized random walk that is fundamental to graph nodes clustering and generalized it to bipartite graphs for a specific case where the proobability of random jump was proprtional to the number of links of "personally prefereed" nodes. In this paper we turn to the more complex issue of graphs in which the random jump follows uniform distribution.
Keywords
Cite
@article{arxiv.1702.03734,
title = {Traditional PageRank versus Network Capacity Bound},
author = {Mieczysław A. Kłopotek and Sławomir T. Wierzchom and Robert A. Kłopotek and Elżbieta A. Kłopotek},
journal= {arXiv preprint arXiv:1702.03734},
year = {2017}
}