Mihyun Kang

activity

20052023

most citedCharting the replica symmetric phase

35 citations · 185 across the 58 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018★ 1 cited

Subcritical random hypergraphs, high-order components, and hypertrees

Oliver Cooley, Wenjie Fang, Nicola Del Giudice +1

In the binomial random graph $G (n, p)$ , when $p$ changes from $(1 - ε) / n$ (subcritical case) to $1/ n$ and then to $(1 + ε) / n$ (supercritical case) for $\va…

math.CO2018

Vanishing of cohomology groups of random simplicial complexes

Oliver Cooley, Nicola Del Giudice, Mihyun Kang +1

We consider $k$ -dimensional random simplicial complexes that are generated from the binomial random $(k + 1)$ -uniform hypergraph by taking the downward-closure, where $k \geq 2$ . For…

math.CO2018

The genus of the Erdős-Rényi random graph and the fragile genus property

Chris Dowden, Mihyun Kang, Michael Krivelevich

We investigate the genus $g (n, m)$ of the Erdős-Rényi random graph $G (n, m)$ , providing a thorough description of how this relates to the function $m = m (n)$ , and finding that there is…

math.CO2018

The size of the giant component in random hypergraphs: a short proof

Oliver Cooley, Mihyun Kang, Christoph Koch

We consider connected components in $k$ -uniform hypergraphs for the following notion of connectedness: given integers $k \geq 2$ and $1 \leq j \leq k - 1$ , two $j$ -sets (of vertices) lie…