Network Capacity Bound for Personalized PageRank in Multimodal Networks

DOI10.3233/FI-222151arXiv1706.00178MaRDI QIDQ6094516FDOQ6094516

Mieczysław Kłopotek, Sławomir T. Wierzchoń, Robert A. Kłopotek

Publication date: 14 September 2023

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1706.00178

zbMATH Keywords

random walksocial networksrankingmultimodal networksPageRankauthority flow boundsM-uniform M-partite hypergraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Hypergraphs (05C65) Random walks on graphs (05C81) Network design and communication in computer systems (68M10)

Cites Work

• On the localization of the personalized PageRank of complex networks
• Google's PageRank and beyond. The science of search engine rankings
• A Survey on PageRank Computing
• A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
• PageRank beyond the web
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• The cover times of random walks on random uniform hypergraphs
• Title not available (Why is that?)
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Generic Damping Functions for Propagating Importance in Link-Based Ranking
• Search engines, link analysis, and user's web behavior. A unifying web mining approach
• A note on the PageRank of undirected graphs
• Matchings in k‐partite k‐uniform hypergraphs
• Title not available (Why is that?)

Cited In (1)

• Parametric controllability of the personalized PageRank: Classic model vs biplex approach

This page was built for publication: Network Capacity Bound for Personalized PageRank in Multimodal Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094516)