Jigsaw percolation on random hypergraphs
Jigsaw percolation on random hypergraphs
复制标题
随机超图上的拼图渗透
DOI：
10.1017/jpr.2017.62
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Christoph Koch
中科院分区：
文献类型：
--
作者：
B. Bollobás;Oliver Cooley;Mihyun Kang;Christoph Koch
图上的拼图渗透过程由 Brummitt、Chatterjee、Dey 和 Sivakoff 提出，作为社交网络中难题协作解决方案的模型。这个过程中的渗透可以被视为公共顶点集上两个图的联合连通性。我们的目标是将 Bollob'as、Riordan、Slivken 和 Smith 关于此过程的结果扩展到超图，以获得各种可能的连通性定义。特别是，当随机选择两个超图时，我们确定了渗流临界阈值概率的渐近阶。
The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation in this process may be viewed as the joint connectedness of two graphs on a common vertex set. Our aim is to extend a result of Bollob\'as, Riordan, Slivken, and Smith concerning this process to hypergraphs for a variety of possible definitions of connectedness. In particular, we determine the asymptotic order of the critical threshold probability for percolation when both hypergraphs are chosen binomially at random.