ISSN 1944-9488
Vol. 9, Issue 1, 2012December 31, 2012 EDT
High-Order Random Walks and Generalized Laplacians on Hypergraphs
High-Order Random Walks and Generalized Laplacians on Hypergraphs
Articles in Vol. 9, Issue 1, 2012
Vol. 9, Issue 1, 2012
- Special Issue on Algorithms and Models for the Web GraphPaul HornAlan FriezePaweł Prałat
- High-Order Random Walks and Generalized Laplacians on HypergraphsXing PengLinyuan Lu
- Discovery of Nodal Attributes through a Rank-Based Model of Network StructurePaweł PrałatAdam Douglas Henry
- Extracting the Core Structure of Social Networks Using (α, β)-CommunitiesHongyu LiangJohn HopcroftSupasorn SuwajanakornJing HeLiaoruo Wang
- On Clustering on Graphs with Multiple Edge TypesMatthew RocklinAli Pinar
- Dirichlet PageRank and Ranking Algorithms Based on Trust and DistrustFan ChungAlexander TsiatasWensong Xu
Peng, Xing, and Linyuan Lu. 2013. “High-Order Random Walks and Generalized Laplacians on Hypergraphs.” Internet Mathematics 9 (1). https://doi.org/10.1080/15427951.2012.678151.