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.

翻译：在前一份文件中,采用了Bipartite PageRank的概念,并普遍采用了关于个人化PageRank个人化PageRank之间节点之间权力界限的理论。在本文中,我们希望将这些结果扩大到多式联运网络。特别是,我们处理的是一种用于描述多式联运网络的高光学类型,其中超链接将每种模式的节点连接在一起。我们对这些图表采用PageRank的概括,并界定可用于计算的各种随机行走模式。我们说明并证明,对于单个模式具有相同和独特的障碍因素的案件,权力外流的限度。