We study bootstrap percolation processes on random simplicial complexes of some fixed dimension . Starting from a single simplex of dimension , we build our complex dynamically in the following fashion. We introduce new vertices one by one, all equipped with a random weight from a fixed distribution . The newly arriving vertex selects an existing -dimensional face at random, with probability proportional to some positive and symmetric function of the weights of its vertices, and attaches to it by forming a -dimensional simplex. After a complex on vertices is constructed, we infect every vertex independently at random with some probability . Then, in consecutive rounds, we infect every healthy vertex the neighbourhood of which contains at least disjoint -dimensional, fully infected faces. Using a reduction to the generalised P'olya urn schemes, we determine the value of critical probability $p_c = p_c (n; \mu, f)p \gg p_cn \to \infty$, the infection spreads to the whole vertex set of the complex, while if then the infection process stops with healthy vertices remaining in the complex.

生成讲解博客的中文版本

生成AI智能校验的中文版本