Author

Micha Christoph

h-index 5 View on Semantic Scholar

We have 2 of 22 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Thinning and sprinkling: from robust sampling to almost Hamiltonicity

We develop the thinning--sprinkling technique, a general method for proving robustness of graph properties under random vertex sampling. Using it, we show that random induced subgraphs of tough graphs, high-degree connected vertex-transitive graphs, and nearly regular sublinear expanders retain strong connectivity or e...

Micha Christoph, Zach Hunter, Benny Sudakov · 2 citations · ⚡1

Preprint Aug 2026

The critical probability for percolation on finite graphs

We determine the critical probability for Bernoulli bond percolation on essentially any finite graph. Namely, letting $\lambda(G)$ denote the spectral radius (maximum eigenvalue) of $G$, we prove that the critical probability is at $1/\lambda(G)$: above this probability there is typically a component of order $\Omega(\...

Micha Christoph, Patryk Morawski, Yuval Wigderson · 1 citation