Traditional PageRank versus Network Capacity Bound

  title={Traditional PageRank versus Network Capacity Bound},
  author={Mieczysław A. Kłopotek and Slawomir T. Wierzchon and Robert A. Klopotek and Elzbieta A. Klopotek},
  • Mieczysław A. Kłopotek, Slawomir T. Wierzchon, +1 author Elzbieta A. Klopotek
  • Published in ADMA 2019
  • Computer Science
  • 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. 
    Twitter Mentions

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper


    Publications citing this paper.