50:36
publiée le 6 février 2026
On some deterministic version of the random walk on $\mathbb{Z}^d$
De Dalia Terhesiu
De Omer Angel
Apparaît dans les collections : Random trees and maps: probabilistic and combinatorial aspects / Arbres et cartes aléatoires : aspects probabilistes et combinatoires, Exposés de recherche
On a graph $G$, we consider the bootstrap model: some vertices are infected and any vertex with 2 infected vertices becomes infected. We identify the location of the threshold for the event that the Erdos-Renyi graph $G(n, p)$ can be fully infected by a seed of only two infected vertices. Joint work with Brett Kolesnik.