Sampling hypergraphs via joint unbiased random walk

被引:0
|
作者
Qi Luo
Zhenzhen Xie
Yu Liu
Dongxiao Yu
Xiuzhen Cheng
Xuemin Lin
Xiaohua Jia
机构
[1] Shandong University,School of Computer Science and Technology
[2] Shanghai Jiao Tong University,Antai College of Economics and Management
[3] City University of Hong Kong,Department of Computer Science
来源
World Wide Web | 2024年 / 27卷
关键词
Random walk; Markov chain Monte Carlo; Unbiased sampling; Hypergraph;
D O I
暂无
中图分类号
学科分类号
摘要
Hypergraphs are instrumental in modeling complex relational systems that encompass a wide spectrum of high-order interactions among components. One prevalent analysis task is the properties estimation of large-scale hypergraphs, which involves selecting a subset of nodes and hyperedges while preserving the characteristics of the entire hypergraph. This paper aims to sample hypergraphs via random walks and is the first to perform unbiased random walks for sampling of nodes and hyperedges simultaneously in large-scale hypergraphs to the best of our knowledge. Initially, we analyze the stationary distributions of nodes and hyperedges for the simple random walk, and show that there is a high bias in both nodes and hyperedges. Subsequently, to eliminate the high bias of the simple random walk, we propose unbiased random walk strategies for nodes and hyperedges, respectively. Finally, a single joint walk schema is developed for sampling nodes and hyperedges simultaneously. To accelerate the convergence process, we employ delayed acceptance and history-aware techniques to assist our algorithm in achieving fast convergence. Extensive experimental results validate our theoretical findings, and the unbiased sampling algorithms for nodes and hyperedges have their complex hypergraph scenarios for which they are applicable. The joint random walk algorithm balanced the sampling applicable to both nodes and hyperedges.
引用
收藏
相关论文
共 50 条
  • [1] Sampling hypergraphs via joint unbiased random walk
    Luo, Qi
    Xie, Zhenzhen
    Liu, Yu
    Yu, Dongxiao
    Cheng, Xiuzhen
    Lin, Xuemin
    Jia, Xiaohua
    [J]. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2024, 27 (02):
  • [2] On Random Sampling in Uniform Hypergraphs
    Czygrinow, Andrzej
    Nagle, Brendan
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (04) : 422 - 440
  • [3] Social Graph Restoration via Random Walk Sampling
    Nakajima, Kazuki
    Shudo, Kazuyuki
    [J]. 2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, : 806 - 819
  • [4] Scalable unbiased sampling method based on multi-peer adaptive random walk
    Fu, Yong-Quan
    Wang, Yi-Jie
    Zhou, Jing
    [J]. Ruan Jian Xue Bao/Journal of Software, 2009, 20 (03): : 630 - 643
  • [5] AN ALGORITHM FOR UNBIASED RANDOM SAMPLING
    ERNVALL, J
    NEVALAINEN, O
    [J]. COMPUTER JOURNAL, 1982, 25 (01): : 45 - 47
  • [6] RANDOM WALK ACCEPTANCE SAMPLING
    TERRELL, MP
    BEIGHTLE.CS
    [J]. TOOL AND MANUFACTURING ENGINEER, 1968, 61 (05): : 26 - &
  • [7] From unbiased to maximal-entropy random walks on hypergraphs
    Traversa, Pietro
    de Arruda, Guilherme Ferraz
    Moreno, Yamir
    [J]. PHYSICAL REVIEW E, 2024, 109 (05)
  • [8] Estimating the Bot Population on Twitter via Random Walk Based Sampling
    Fukuda, Mei
    Nakajima, Kazuki
    Shudo, Kazuyuki
    [J]. IEEE ACCESS, 2022, 10 : 17201 - 17211
  • [9] Graph sampling by lagged random walk
    Zhang, Li-Chun
    [J]. STAT, 2022, 11 (01):
  • [10] Random sampling: Billiard Walk algorithm
    Gryazina, Elena
    Polyak, Boris
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (02) : 497 - 504