5 citations · 32 across the 42 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
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…
math.CO2023
Catching a robber on a random -uniform hypergraph
Joshua Erde, Mihyun Kang, Florian Lehner +2
The game of \emph{Cops and Robber} is usually played on a graph, where a group of cops attempt to catch a robber moving along the edges of the graph. The \emph{cop number} of a gra…
math.PR2023
Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs
Sahar Diskin, Joshua Erde, Mihyun Kang +1
It is known that many different types of finite random subgraph models undergo quantitatively similar phase transitions around their percolation thresholds, and the proofs of these…