Mihyun Kang

activity

20162026

most citedResolution of a conjecture on majority dynamics: rapid stabilisation in dense random graphs

2 citations · 2 across the 19 of their papers we have counts for

collaborators

Showing 2024Show all

4 papers · 1 filter

math.CO2024

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs

Sahar Diskin, Joshua Erde, Mihyun Kang +1

Given a graph $G$ and $p \in [0, 1]$ , the random subgraph $G_{p}$ is obtained by retaining each edge of $G$ independently with probability $p$ . We show that for every $ε > 0$ , there exis…

math.CO2024

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs

Maurício Collares, Joshua Erde, Anna Geisler +1

Majority bootstrap percolation is a monotone cellular automaton that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new v…

math.CO2024

Bootstrap percolation on the high-dimensional Hamming graph

Mihyun Kang, Michael Missethan, Dominik Schmid

In the random $r$ -neighbour bootstrap percolation process on a graph $G$ , a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently wit…

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$ -…

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs

Bootstrap percolation on the high-dimensional Hamming graph

Bootstrap Percolation on the Binomial Random k-uniform Hypergraph

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