Network Capacity Bound for Personalized PageRank in Multimodal Networks

DOI10.3233/fi-222151arXiv1706.00178MaRDI QIDQ6094516

Mieczysław Kłopotek, S. T. Wierzchon, Robert A. Kłopotek

Publication date: 14 September 2023

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

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

zbMATH Keywords

rankingsocial networksrandom walkPageRankmultimodal networksauthority flow boundsM-uniform M-partite hypergraphs

Mathematics Subject Classification ID

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

Cites Work

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

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