From the 1 of 13 linked papers with an AI index.
13 papers
A short proof of a central limit theorem for the order of the giant component and -core
Michael Anastos, Joshua Erde, Mihyun Kang +1
The paper introduces a simple approach based on the Efron–Stein inequality to prove central limit theorems for the size of the giant component and the k‑core in sparse random graph…
Counting independent sets in percolated graphs via the Ising model
Anna Geisler, Mihyun Kang, Michail Sarantis +1
Given a graph , we form a random subgraph by including each edge of independently with probability . We provide an asymptotic expansion of the expected number of in…
Counting subgraphs in bounded-size Achlioptas processes
Mihyun Kang, Oliver Riordan
Achlioptas processes such as the Bohman--Frieze process are much harder to analyse than the classical ErdÅs--Rényi process, due to the dependence between edges added at different…
Block-weighted random graphs: planar and beyond
Mihyun Kang, Zéphyr Salvy, Ronen Wdowinski
We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of -connected components, or blocks. This includes the class…
Uniqueness and locality of the ground state of the disordered Monomer-Dimer models on independently weighted Unimodular Bienaymé-Galton-Watson trees
Mihyun Kang, Mike Liu
Consider a finite graph and two continuous weight distributions and , for which we only assume that is lower bounded. Next, independently draw weights…
Sampling from the antiferromagnetic Ising model on bipartite, regular expander graphs
Anna Geisler, Mihyun Kang, Michail Sarantis +1
The antiferromagnetic Ising model samples subsets of vertices of a graph with weight decaying exponentially in the number of edges induced. We study the problem of sampling from th…