Propagation Connectivity of Random Hypergraphs

被引：0
|
作者：
Coja-Oghlan, Amin [1 ]
Onsjoe, Mikael [2 ]
Watanabe, Osamu [2 ]
机构：
[1] Univ Warwick, Math & Comp Sci, Zeeman Bldg, Coventry CV4 7AL, W Midlands, England
[2] Tokyo Inst Technol, Dept Comp Sci & Math, Ookayama, Japan
来源：
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES | 2010年 / 6302卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the concept of propagation connectivity on random 3-uniform hypergraphs. This concept is defined for investigating the performance of a simple algorithm for solving instances of certain constraint satisfaction problems. We derive upper and lower bounds for edge probability of random 3-uniform hypergraphs such that the propagation connectivity holds. Based on our analysis, we also show the way to implement the simple algorithm so that it runs in linear time on average.
引用
收藏
页码：490 / +
页数：2
相关论文
共 50 条
  • [11] Connectivity of Cartesian Product of Hypergraphs
    Wang, Na
    Meng, Jixiang
    Tian, Yingzhi
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2022, 48 (05) : 2379 - 2393
  • [12] Steiner connectivity problems in hypergraphs
    Horsch, Florian
    Szigeti, Zoltan
    INFORMATION PROCESSING LETTERS, 2024, 183
  • [13] Edge-connectivity in hypergraphs
    Zhao, Shuang
    Li, Dan
    Meng, Jixiang
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2021, 52 (03): : 837 - 846
  • [14] Connectivity of Cartesian Product of Hypergraphs
    Na Wang
    Jixiang Meng
    Yingzhi Tian
    Bulletin of the Iranian Mathematical Society, 2022, 48 : 2379 - 2393
  • [15] Coloring hypergraphs of low connectivity
    Schweser, Thomas
    Stiebitz, Michael
    Toft, Bjarne
    JOURNAL OF COMBINATORICS, 2022, 13 (01) : 1 - 21
  • [16] Random recursive hypergraphs
    Krapivsky, P. L.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2023, 56 (19)
  • [17] Bicolouring random hypergraphs
    Castellani, T
    Napolano, V
    Ricci-Tersenghi, F
    Zecchina, R
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2003, 36 (43): : 11037 - 11053
  • [18] Choosability in random hypergraphs
    Krivelevich, M
    Vu, VH
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 83 (02) : 241 - 257
  • [19] Random hypergraphs and their applications
    Ghoshal, Gourab
    Zlatic, Vinko
    Caldarelli, Guido
    Newman, M. E. J.
    PHYSICAL REVIEW E, 2009, 79 (06)
  • [20] On the decomposition of random hypergraphs
    Peng, Xing
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 129 : 18 - 37
12345