Name
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 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. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Social and Information Networks | Modalities,Data mining,PageRank,Computer science,Random walk,Generalization,Bipartite graph,Hypergraph,Hyperlink,Computation |
DocType | Volume | Citations |
Journal | abs/1706.00178 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mieczyslaw A. Klopotek | 1 | 366 | 78.58 |
| Slawomir T. Wierzchon | 2 | 362 | 63.62 |
| R. A. Klopotek | 3 | 0 | 0.34 |