Christoph Koch

activity

20152024

most citedThreshold and hitting time for high-order connectivity in random hypergraphs

4 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2024

Bootstrap Percolation on the Binomial Random $k$ -uniform Hypergraph

Mihyun Kang, Christoph Koch, Tamás Makai

We investigate the behaviour of $r$ -neighbourhood bootstrap percolation on the binomial $k$ -uniform random hypergraph $H_{k} (n, p)$ for given integers $k \geq 2$ and $r \geq 2$ . In $r$ -…

math.PR2019

Bivariate fluctuations for the number of arithmetic progressions in random sets

Yacine Barhoumi-Andréani, Christoph Koch, Hong Liu

We study arithmetic progressions ${a, a + b, a + 2 b, \dots, a + (ℓ - 1) b}$ , with $ℓ \geq 3$ , in random subsets of the initial segment of natural numbers $[n] := {1, 2, \dots, n}$ . Given $…

Bootstrap Percolation on the Binomial Random k-uniform Hypergraph

Bivariate fluctuations for the number of arithmetic progressions in random sets

Bootstrap Percolation on the Binomial Random $k$ -uniform Hypergraph