B. Kolesnik

collaborators

4 papers

math.PR2026

The critical activation density in graph bootstrap percolation

Brett Kolesnik, Tamás Makai, TamÃ¡s Makai +6

In graph bootstrap percolation, edges of an Erdős-Rényi random graph $G_{n, p}$ are initially active, and activation spreads to other edges of $K_{n}$ via the combinatorics…

math.PR2025

Sharp Fuss-Catalan thresholds in graph bootstrap percolation

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg +1

We study graph bootstrap percolation on the ErdÅs-RÃ©nyi random graph $G_{n, p}$ . For all $r \geq 5$ , we locate the sharp $K_{r}$ -percolation threshold $p_c \sim (Î³n)^{-1/…

math.PR2025

On the threshold for triangulations inside convex polygons

Brett Kolesnik, Georgii Zakharov, Maksim Zhukovskii

Start with a large convex polygon and add all other edges inside independently with probability $p$ . At what critical threshold $p_{c}$ do triangulations of the polygon begin to appe…

math.PR2025

Catalan percolation

Eleanor Archer, Ivailo Hartarsky, Brett Kolesnik +3

In Catalan percolation, all nearest-neighbor edges ${i, i + 1}$ along $Z$ are initially occupied, and all other edges are open independently with probability $p$ . Open edges…