Mihyun Kang

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 52

Top Topics

Phase Transition

Randomly Distributed

Connected Components

Top Venues

Electron. J. Comb.

Electron. Notes Discret. Math.

SIAM J. Discret. Math.

Random Struct. Algorithms

Publications

Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien
The $k$-XORSAT Threshold Revisited. Electron. J. Comb. 31 (2) (2024)
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich
Percolation on irregular high-dimensional product graphs. Comb. Probab. Comput. 33 (3) (2024)
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. Comb. 44 (4) (2024)
Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien
The k-XORSAT threshold revisited. CoRR (2023)
Mihyun Kang, Michael Missethan
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes. SIAM J. Discret. Math. 37 (1) (2023)
Mikhail Isaev, Mihyun Kang
On the Chromatic Number in the Stochastic Block Model. Electron. J. Comb. 30 (2) (2023)
Tuan A. Do, Joshua Erde, Mihyun Kang, Michael Missethan
Component Behaviour and Excess of Random Bipartite Graphs Near the Critical Point. Electron. J. Comb. 30 (3) (2023)
David Gamarnik, Mihyun Kang, Pawel Pralat
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. CoRR (2023)
Mihyun Kang, Michael Missethan
Concentration of maximum degree in random planar graphs. J. Comb. Theory, Ser. B 156 (2022)
Oliver Cooley, Mihyun Kang, Julian Zalla
Loose Cores and Cycles in Random Hypergraphs. Electron. J. Comb. 29 (4) (2022)
Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel
Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes. Electron. J. Comb. 29 (3) (2022)
Tuan A. Do, Joshua Erde, Mihyun Kang
Planarity and Genus of Sparse Random Bipartite Graphs. SIAM J. Discret. Math. 36 (2) (2022)
Mihyun Kang, Michael Missethan
Longest and shortest cycles in random planar graphs. Random Struct. Algorithms 60 (3) (2022)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana
The Sparse Parity Matrix. SODA (2022)
Wenjie Fang, Hsien-Kuei Hwang, Mihyun Kang
Phase transitions from exp⁡(n1/2) to exp⁡(n2/3) in the asymptotics of banded plane partitions. J. Comb. Theory, Ser. A 178 (2021)
Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov
Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. 35 (1) (2021)
Oliver Cooley, Frederik Garbe, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala, Julian Zalla
Longest Paths in Random Hypergraphs. SIAM J. Discret. Math. 35 (4) (2021)
Joshua Erde, Mihyun Kang, Michael Krivelevich
Large complete minors in random subgraphs. Comb. Probab. Comput. 30 (4) (2021)
Mihyun Kang, Michael Moßhammer, Philipp Sprüssel
Phase transitions in graphs on orientable surfaces. Random Struct. Algorithms 56 (4) (2020)
Mihyun Kang, Michael Missethan
The Giant Component and 2-Core in Sparse Random Outerplanar Graphs. AofA (2020)
Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril
Preface. Eur. J. Comb. 88 (2020)
Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel
Vanishing of cohomology groups of random simplicial complexes. Random Struct. Algorithms 56 (2) (2020)
Chris Dowden, Mihyun Kang, Michael Krivelevich
The genus of the Erdős-Rényi random graph and the fragile genus property. Random Struct. Algorithms 56 (1) (2020)
Nikolaos Fountoulakis, Mihyun Kang, Tamás Makai
Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs. Random Struct. Algorithms 57 (4) (2020)
Zhicheng Gao, Mihyun Kang
Counting Cubic Maps with Large Genus. AofA (2020)
Oliver Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees. SIAM J. Discret. Math. 34 (4) (2020)
Mihyun Kang, Tamás Makai, Oleg Pikhurko
Supersaturation problem for the bowtie. Eur. J. Comb. 88 (2020)
Oliver Cooley, Mihyun Kang, Christoph Koch
The Size of the Giant Component in Random Hypergraphs: a Short Proof. Electron. J. Comb. 26 (3) (2019)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
-core of random graphs. J. Comb. Theory, Ser. B 137 (2019)
Chris Dowden, Mihyun Kang, Mirjana Mikalacki, Milos Stojakovic
The Toucher-Isolator game. Electron. J. Comb. 26 (4) (2019)
Oliver Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang
Subcritical random hypergraphs, high-order components, and hypertrees. ANALCO (2019)
Oliver Cooley, Mihyun Kang, Yury Person
Largest Components in Random Hypergraphs. Comb. Probab. Comput. 27 (5) (2018)
Mihyun Kang, Philipp Sprüssel
Symmetries of Unlabelled Planar Triangulations. Electron. J. Comb. 25 (1) (2018)
Wenjie Fang, Mihyun Kang, Michael Moßhammer, Philipp Sprüssel
Cubic Graphs and Related Triangulations on Orientable Surfaces. Electron. J. Comb. 25 (1) (2018)
Hsien-Kuei Hwang, Mihyun Kang, Guan-Huei Duh
Asymptotic Expansions for Sub-Critical Lagrangean Forms. AofA (2018)
Oliver Cooley, Mihyun Kang, Christoph Koch
The size of the giant high-order component in random hypergraphs. Random Struct. Algorithms 53 (2) (2018)
Chris Dowden, Mihyun Kang, Michael Krivelevich
The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property. AofA (2018)
Chris Dowden, Mihyun Kang, Philipp Sprüssel
The Evolution of Random Graphs on Surfaces. SIAM J. Discret. Math. 32 (1) (2018)
Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel
Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers). AofA (2018)
Mihyun Kang, Michael Moßhammer, Philipp Sprüssel
Evolution of the giant component in graphs on orientable surfaces. Electron. Notes Discret. Math. 61 (2017)
Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril
Preface. Electron. Notes Discret. Math. 61 (2017)
Mihyun Kang, Tamás Makai, Oleg Pikhurko
Supersaturation Problem for the Bowtie. Electron. Notes Discret. Math. 61 (2017)
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos
Charting the replica symmetric phase. CoRR (2017)
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos
Charting the Replica Symmetric Phase. APPROX-RANDOM (2017)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
Core forging and local limit theorems for the k-core of random graphs. CoRR (2017)
Chris Dowden, Mihyun Kang, Philipp Sprüssel
The evolution of random graphs on surfaces. Electron. Notes Discret. Math. 61 (2017)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
The Minimum Bisection in the Planted Bisection Model. Theory Comput. 13 (1) (2017)
Oliver Cooley, Penny Haxell, Mihyun Kang, Philipp Sprüssel
Homological connectedness of random hypergraphs. Electron. Notes Discret. Math. 61 (2017)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
How does the core sit inside the mantle? Random Struct. Algorithms 51 (3) (2017)
Béla Bollobás, Oliver Cooley, Mihyun Kang, Christoph Koch
Jigsaw percolation on random hypergraphs. J. Appl. Probab. 54 (4) (2017)
Oliver Cooley, Mihyun Kang, Christoph Koch
Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. Electron. J. Comb. 23 (2) (2016)
Andrea Jiménez, Mihyun Kang, Martin Loebl
Cubic Bridgeless Graphs and Braces. Graphs Comb. 32 (6) (2016)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
The minimum bisection in the planted bisection model. CoRR (2015)
Mihyun Kang, Christoph Koch, Tamás Makai
Bootstrap percolation in random k-uniform hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Mihyun Kang, Christoph Koch, Angélica Pachón
The Phase Transition in Multitype Binomial Random Graphs. SIAM J. Discret. Math. 29 (2) (2015)
Mihyun Kang, Philipp Sprüssel
Characterisation of symmetries of unlabelled triangulations. Electron. Notes Discret. Math. 49 (2015)
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
-Uniform Hypergraphs' - CORRIGENDUM. Comb. Probab. Comput. 24 (1) (2015)
Oliver Cooley, Mihyun Kang, Christoph Koch
Evolution of high-order connected components in random hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
How does the core sit inside the mantle? Electron. Notes Discret. Math. 49 (2015)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
How does the core sit inside the mantle? CoRR (2015)
Mihyun Kang, Michael Moßhammer, Philipp Sprüssel, Wenjie Fang
Enumeration of cubic multigraphs on orientable surfaces. Electron. Notes Discret. Math. 49 (2015)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
The Minimum Bisection in the Planted Bisection Model. APPROX-RANDOM (2015)
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
Local Limit Theorems for the Giant Component of Random Hypergraphs. Comb. Probab. Comput. 23 (3) (2014)
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
-Uniform Hypergraphs. Comb. Probab. Comput. 23 (3) (2014)
Mihyun Kang, Konstantinos Panagiotou
On the connectivity of random graphs from addable classes. J. Comb. Theory, Ser. B 103 (2) (2013)
Mihyun Kang, Will Perkins, Joel Spencer
The Bohman-Frieze process near criticality. Random Struct. Algorithms 43 (2) (2013)
Mihyun Kang, Colin McDiarmid
Random unlabelled graphs containing few disjoint cycles. Random Struct. Algorithms 38 (1-2) (2011)
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
Untangling planar graphs from a specified vertex position - Hard cases. Discret. Appl. Math. 159 (8) (2011)
Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué
Asymptotic Study of Subcritical Graph Classes. SIAM J. Discret. Math. 25 (4) (2011)
Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. 40 (3) (2011)
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. 39 (6) (2010)
Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
Boltzmann Samplers, Pólya Theory, and Cycle Pointing CoRR (2010)
Peter J. Cameron, Mihyun Kang, Dudley Stark
Random preorders and alignments. Discret. Math. 310 (3) (2010)
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
The order of the giant component of random hypergraphs. Random Struct. Algorithms 36 (2) (2010)
Amin Coja-Oghlan, Mihyun Kang
The evolution of the min-min random graph process. Discret. Math. 309 (13) (2009)
Guillaume Chapuy, Éric Fusy, Mihyun Kang, Bilyana Shoilekova
A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components. Electron. J. Comb. 15 (1) (2008)
Mihyun Kang, Taral Guldahl Seierstad
The Critical Phase for Random Graphs with a Given Degree Sequence. Comb. Probab. Comput. 17 (1) (2008)
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
Obfuscated Drawings of Planar Graphs CoRR (2008)
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32 (2) (2008)
Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy
Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28 (8) (2007)
Mihyun Kang
Evolution of random graph processes with degree constraints. Electron. Notes Discret. Math. 28 (2007)
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379 (3) (2007)
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
Local Limit Theorems for the Giant Component of Random Hypergraphs. APPROX-RANDOM (2007)
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP (2007)
Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid
Random cubic planar graphs. Random Struct. Algorithms 30 (1-2) (2007)
Mihyun Kang, Taral Guldahl Seierstad
Phase transition of the minimum degree random multigraph process. Random Struct. Algorithms 31 (3) (2007)
Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA (2007)
Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electron. J. Comb. 14 (1) (2007)
Mihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Luczak
The connectivity threshold for the min-degree random graph process. Random Struct. Algorithms 29 (1) (2006)
Manuel Bodirsky, Mihyun Kang
Generating Outerplanar Graphs Uniformly at Random. Comb. Probab. Comput. 15 (3) (2006)
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
Sampling Unlabeled Biconnected Planar Graphs. ISAAC (2005)
Mihyun Kang
Random walks on a finite graph with congestion points. Appl. Math. Comput. 153 (2) (2004)
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
Generating Labeled Planar Graphs Uniformly at Random. ICALP (2003)