Phase transitions in random combinatorial structures

Results:

• Bootstrap percolation on the high dimensional Hamming graph.
  Mihyun Kang, Michael Missethan, Dominik Schmid
  arXiv:2406.13341 (associated to Project 5)
• Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs.
  Mauricio Collares, Joshua Erde, Anna Geisler, Mihyun Kang
  arXiv:2406.17486 (associated to Project 5) 
• Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs.
  Sahar Diskin, Joshua Erde, Mihyun Kang, and Michael Krivelevich  
  arXiv:2407.16458 (associated to Project 5)
• Universality of the matching number in percolated regular graphs
  Sahar Diskin, Mihyun Kang, and Lyuben Lichev
  arXiv:2503.11242 (associated to Project 5)
• Counting independent sets in expanding bipartite regular graphs
  Mauricio Collares, Joshua Erde, Anna Geisler, and Mihyun Kang
  arXiv:2503.22255 (associated to Project 5)
• Counting independent sets in percolated graphs via the Ising model
  Anna Geisler, Mihyun Kang, Michail Sarantis, and Ronen Wdowinski
  arXiv:2504.08715 (associated to Project 5)