High-dimensional bootstrap processes in evolving simplicial complexes

TL;DR

This paper analyzes bootstrap percolation on evolving random simplicial complexes, establishing critical infection probabilities that determine whether the infection spreads throughout the complex or not.

Contribution

It introduces a new model of evolving simplicial complexes with weighted vertices and determines the critical infection probability using a reduction to Pólya urn schemes.

Findings

Critical probability $p_c$ for infection spread is derived.

Infection percolates with high probability if $p o p_c$ from above.

Infection fails to spread if $p o p_c$ from below.

Abstract

We study bootstrap percolation processes on random simplicial complexes of some fixed dimension $d \geq 3$. Starting from a single simplex of dimension $d$, 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 $\mu$. The newly arriving vertex selects an existing $(d-1)$-dimensional face at random, with probability proportional to some positive and symmetric function $f$ of the weights of its vertices, and attaches to it by forming a $d$-dimensional simplex. After a complex on $n$ vertices is constructed, we infect every vertex independently at random with some probability $p = p(n)$. Then, in consecutive rounds, we infect every healthy vertex the neighbourhood of which contains at least $r$ disjoint $(k-1)$-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)$, such that if $p \gg p_c$ then, with probability tending to 1 as $n \to \infty$, the infection spreads to the whole vertex set of the complex, while if $p \ll p_c$ then the infection process stops with healthy vertices remaining in the complex.