Authors:
Loc Tran,Tho Quan,An Mai,DOI NO:
https://doi.org/10.26782/jmcms.spl.4/2019.11.00004Keywords:
Directed Hypergraph,Laplacian,Metabolic Network,Pagerank Algorithm,Abstract
During the last two decades, we easily 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.Refference:
I. Brin, Sergey, and Lawrence Page. “The anatomy of a large-scale hypertextual
web search engine.” Computer networks and ISDN systems 30.1-7 (1998):
107-117.
II. Bonato, Anthony. A course on the web graph. Vol. 89. American
Mathematical Soc., 2008.
III. Ausiello, Giorgio, Paolo G. Franciosa, and Daniele Frigioni. “Directed
hypergraphs: Problems, algorithmic results, and a novel decremental
approach.” Italian conference on theoretical computer science. Springer,
Berlin, Heidelberg, 2001.
IV. Ducournau, Aurélien, and Alain Bretto. “Random walks in directed
hypergraphs and application to semi-supervised image
segmentation.” Computer Vision and Image Understanding 120 (2014):
91-102.
V. http://systemsbiology.ucsd.edu/Downloads/EcoliCore