2017/02/13 by Mieczysław A. Kłopotek, Sławomir T. Wierzchom, Kłopotek, Mieczysław A. +5
Computer Science · Physics and Astronomy · #Advanced Clustering Algorithms Research #Complex Network Analysis Techniques #Data Management and Algorithms #FOS: Computer and information sciences #Social and Information Networks (cs.SI)
paper · pdf · doi:10.48550/arxiv.1702.03734
openalex publication_date 2017/02/13 · openalex created_date 2022/10/05 · openalex updated_date 2026/08/02
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.