Network Capacity Bound for Personalized PageRank in Multimodal Networks

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

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2023-06
Main Authors: Kłopotek, M A, Wierzchoń, S T, Kłopotek, R A
Format: Article
Language:English
Subjects:
Damping
Nodes
Outflow
Random walk
Search engines
Theorems
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422