Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs

[摘要] We consider the following definition of connectedness in $k$-uniform hypergraphs: two $j$-sets (sets of $j$ vertices) are $j$-connected if there is a walk of edges between them such that two consecutive edges intersect in at least $j$ vertices. The hyperg

[学科分类] 离散数学和组合数学

[关键词] Random Hypergraphs;Connectivity;Hitting Time