SILGMLAug 29, 2019

PageRank algorithm for Directed Hypergraph

arXiv:1909.01132v311 citations
Originality Synthesis-oriented
AI Analysis

This work addresses the modeling of complex networks like the web for researchers in network analysis, but it is incremental as it adapts an existing algorithm to a new graph type.

The authors tackled the problem of modeling the World Wide Web's link structure as a directed hypergraph instead of a directed graph and developed a PageRank algorithm for this model, applying it to a metabolic network due to lack of web datasets, with experiments showing successful application.

During the last two decades, we easilly see that the World Wide Web's link structure is modeled as the directed graph. In this paper, we will model the World Wide Web's link structure as the directed hypergraph. Moreover, we will develop the PageRank algorithm for this directed hypergraph. Due to the lack of the World Wide Web directed hypergraph datasets, we will apply the PageRank algorithm to the metabolic network which is the directed hypergraph itself. The experiments show that our novel PageRank algorithm is successfully applied to this metabolic network.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes