35 citations · 185 across the 58 of their papers we have counts for
64 papers · 1 filter
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…
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…
Percolation on High-dimensional Product Graphs
Sahar Diskin, Joshua Erde, Mihyun Kang +1
We consider percolation on high-dimensional product graphs, where the base graphs are regular and of bounded order. In the subcritical regime, we show that typically the largest co…