M. A. Kłopotek ; S. T. Wierzchoń ; R. A. Kłopotek - Network Capacity Bound for Personalized PageRank in Multimodal Networks

fi:10214 - Fundamenta Informaticae, July 1, 2023, Volume 189, Issue 1
Network Capacity Bound for Personalized PageRank in Multimodal NetworksArticle

Authors: 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 this paper we want to extend those results to multimodal networks. In particular we deal with a hypergraph type that may be used for describing multimodal network where a hyperlink connects nodes from each of the modalities. We introduce a generalisation of PageRank for such graphs and define the respective random walk model that can be used for computations. We state and prove theorems on the limit of outflow of authority for cases where individual modalities have identical and distinct damping factors.


    Volume: Volume 189, Issue 1
    Published on: July 1, 2023
    Accepted on: May 30, 2023
    Submitted on: October 27, 2022
    Keywords: Computer Science - Social and Information Networks,Computer Science - Information Retrieval,Physics - Physics and Society

    Consultation statistics

    This page has been seen 197 times.
    This article's PDF has been downloaded 139 times.