Mihyun Kang  Main 
Publications 
Research Fields 
Academic Services 
Talks and Events 
Teaching 
Combinatorics Group
Research Grant ``Phase transitions and critical phenomena in random graphs''
Summary
Random graph models that this project focuses on are random graph processes and random hypergraphs.
The constraints imposed on these random graph models (in particular random graph processes)
lead to difficulties in the analysis of their asymptotic behaviour,
due to the longterm and/or global dependence between edges.
To overcome these difficulties, new approaches have to be found.
The main objective of this project is to advance analytic and probabilistic approaches
and to apply them to analyse asymptotic behaviour of such complex random graph models.
The scientific program of this project consists of two main themes,
which are closely related in that both themes deal with phase transitions and critical phenomena.
Grant Info
Supported by Austrian Science Fund (FWF), Grant no. P26826, 01.05.201431.12.2017
Team
 Oliver Cooley
 Chris Dowden
 Mihyun Kang (PI)
 Christoph Koch (PhD defence on November 25, 2016)
 Tamas Makai
Collaborators and visitors
 Belá Bollobás, University of Cambridge
 Amin CojaOghlan, Goethe University of Frankfurt
 Nikolaos Fountoulakis, University of Birmingham
 Penny Haxell, University of Waterloo
 Tobias Kapetanopoulos, GoetheUniversität Frankfurt
 Jeong Han Kim, Korea Institute for Advanced Study (KIAS)
 Michael Krievelevich, Tel Aviv University
 Dieter Mitsche, Université de Nice Sophia Antipolis
 Oleg Pikhurko, University of Warwick
 Moumanti Podder, New York University
 Kathrin Skubch, GoetheUniversität Frankfurt
 Joel Spencer, New York University
Publications
Articles submitted for publication
Journal Articles
 Amin CojaOghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch,
Core forging and local limit theorems for the kcore of random graphs, Journal of Combinatorial Theory, Series B (2019), doi: 10.1016/j.jctb.2018.12.005.
 Amin CojaOghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, and Tobias Kapetanopoulos,
Charting the replica symmetric phase,
Communications in Mathematical Physics (2018), 196, doi: 10.1007/s002200183096x.
 Oliver Cooley, Mihyun Kang, and Christoph Koch,
The size of the giant highorder component in random hypergraphs,
Random Structures and Algorithms (2018), doi:10.1002/rsa.20761.
 Oliver Cooley, Mihyun Kang, and Yury Person,
Largest components in random hypergraphs, Combinatorics, Probability and Computing 27 (2018), 741762, doi:10.1017.S096354831800010X.
 Nikolaos Fountoulakis, Mihyun Kang, Christoph Koch, and Tamas Makai,
A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, Annals of Applied Probability 28 (2018), 9901051, doi:10.1214/17AAP1324.
 Béla Bollobás, Oliver Cooley, Mihyun Kang, and Christoph Koch, Jigsaw percolation on random hypergraphs, Journal of Applied Probability 54 (2017), 12611277.
 Amin CojaOghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch,
How does the core sit inside the mantle?, Random Structures and Algorithms 51 (2017), 459482.
 Amin CojaOghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch,
The minimum bisection in the planted bisection model, Theory of Computing 13 (2017), 122.
 Oliver Cooley, Mihyun Kang, and Christoph Koch,
Threshold and hitting time for highorder connectivity in random hypergraphs, Electronic Journal of Combinatorics 23 (2016), #P.48.
 Mihyun Kang, Michal Karonski, Christoph Koch, and Tamas Makai,
Properties of stochastic Kronecker graphs,
Journal of Combinatorics 6 (2015), 395432.

Mihyun Kang, Christoph Koch, and Angélica Pachón,
The phase transition in a multitype binomial random graph,
SIAM Journal on Discrete Mathematics 29 (2015), 10421064.
Articles in PeerReviewed Conference Proceedings
 Amin CojaOghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang and Tobias Kapetanopoulos,
Charting the replica symmetric phase.
In the Proceedings of the 21th International Workshop on Randomization and Computation (RANDOM 2017), 40:140:17.
 Mihyun Kang, Tamas Makai and Oleg Pikhurko,
Supersaturation Problem for the Bowtie.
In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics 61 (2017), pp. 679685.
 Mihyun Kang and Tamas Makai,
Bootstrap percolation on G(n,p) revisited. In the Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2016), 225236.
 Amin CojaOghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch,
The minimum bisection in the planted bisection model.
In the Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM 2015), Leibniz International Proceedings in Informatics (LIPIcs), pp. 710725, 2015.
 Amin CojaOghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch,
How does the core sit inside the mantle?.
In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Electronic Notes in Discrete Mathematics (2015), pp. 489496.
 Mihyun Kang, Christoph Koch, and Tamas Makai,
Bootstrap percolation in random kuniform hypergraphs.
In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Electronic Notes in Discrete Mathematics (2015), pp. 595601.
 Oliver Cooley, Mihyun Kang, and Christoph Koch, Evolution of highorder connected components in random hypergraphs.
In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Electronic Notes in Discrete Mathematics (2015), pp. 569575.
Miscellaneous
 Christoph Koch, Phase transition phenomena in random graphs and hypergraphs, PhD Thesis, November 2016
Joint Workshop of Goethe University Frankfurt and TU Graz, 21  26 August 2016, Söllerhaus at Hirschegg
TU Graz Combinatorics Group
Combinatorics Groups of TU Graz and Goethe Universität Frankfurt
last updated in April 2018
