• Home
  • Search
  • Network Capacity Bound for Personalized PageRank in Multimodal Networks
  • Open Access IconOpen Access
  • https://doi.org/10.3233/fi-222151Copy DOI Icon

Network Capacity Bound for Personalized PageRank in Multimodal Networks

Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

In a former paper [1] 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.

Similar Papers
  • Conference Article
  • Citations1

AMTN: Attention-Enhanced Multimodal Temporal Network for Humor Detection

  • Oct 28, 2024
  • Yangyang Xu +9
  • Research Article
  • Citations35

Large-scale multimodal transportation network models and algorithms-Part II: Network capacity and network design problem

  • Oct 15, 2022
  • Transportation Research Part E: Logistics and Transportation Review
  • Yu Wang +4
  • Research Article
  • Citations2

Incorporating policy mixes to multimodal network capacity considering second-best constraints

  • Oct 25, 2024
  • Transportmetrica A: Transport Science
  • Ziyan Ju +3
  • Research Article
  • Citations1

Machine-Learning-Based Multi-Modal Force Estimation for Steerable Ablation Catheters.

  • Aug 01, 2024
  • IEEE transactions on medical robotics and bionics
  • E Arefinia +2
  • Research Article
  • Citations55

Estimation of urban network capacity with second-best constraints for multimodal transport systems

  • Sep 16, 2021
  • Transportation Research Part B: Methodological
  • Zhiyuan Liu +4
  • PDF
  • Research Article

The Hybrid Traffic Offloading Mode for Disaster‐Resilient Communication Networks Based on User Mobility

  • Jan 01, 2021
  • Wireless Communications and Mobile Computing
  • Ang-Hsun Tsai +1
  • Conference Article

Random walk routing algorithm based on Q-learning in optical transport network

  • Dec 01, 2022
  • Wei Xiao +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.