Showing cs.SIShow all
2 papers · 1 filter
cs.SI2017
Network Capacity Bound for Personalized PageRank in Multimodal Networks
M. A. Kłopotek, S. T. Wierzchoń, R. A. Kłopotek
In a former paper the concept of Bipartite PageRank was introduced and a theorem on the limit of authority flowing between nodes for personalized PageRank has been generalized. In…
cs.SI2017
Traditional PageRank versus Network Capacity Bound
Mieczysław A. Kłopotek, Sławomir T. Wierzchom, Robert A. Kłopotek +1
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 specif…