Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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 introduce 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 finally state and prove theorems on the limit of outflow of
authority for cases where individual modalities have identical and distinct
damping factors.

29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
8
The categories of this paper are: hep-ex
20
The categories of this paper are: acc-phys
25
The categories of this paper are: patt-sol
26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
2
The categories of this paper are: math
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ