2 citations · 2 across the 19 of their papers we have counts for
4 papers · 1 filter
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 s…
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…
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 $(…
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…