35 citations · 185 across the 58 of their papers we have counts for
70 papers
Percolation through Isoperimetry
Sahar Diskin, Joshua Erde, Mihyun Kang +1
We provide a sufficient condition on the isoperimetric properties of a regular graph of growing degree , under which the random subgraph typically undergoes a phase tr…
Partitioning problems via random processes
Michael Anastos, Oliver Cooley, Mihyun Kang +1
There are a number of well-known problems and conjectures about partitioning graphs to satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum, S…
Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs
Sahar Diskin, Joshua Erde, Mihyun Kang +1
It is known that many different types of finite random subgraph models undergo quantitatively similar phase transitions around their percolation thresholds, and the proofs of these…
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
David Gamarnik, Mihyun Kang, Pawel Pralat
The semi-random graph process is a single player game in which the player is initially presented an empty graph on vertices. In each round, a vertex is presented to the pla…
The -XORSAT threshold revisited
Amin Coja-Oghlan, Mihyun Kang, Lena Krieg +1
We provide a simplified proof of the random -XORSAT satisfiability threshold theorem. As an extension we also determine the full rank threshold for sparse random matrices over f…
Percolation on Irregular High-dimensional Product Graphs
Sahar Diskin, Joshua Erde, Mihyun Kang +1
We consider bond percolation on high-dimensional product graphs , where denotes the Cartesian product. We call the the base graphs and…