1 citations · 1 across the 6 of their papers we have counts for
6 papers
Antiferromagnetic models are clique-minimizing
Joonkyung Lee, Jaehyeon Seo
An edge-weighted graph , possibly with loops, is antiferromagnetic if its adjacency matrix is entrywise nonnegative and has at most one positive eigenvalue, counted with multipl…
Lower bounds for multivariate independence polynomials and their generalisations
Joonkyung Lee, Jaehyeon Seo
In statistical physics, the multivariate hard-core model describes a system of particles, each of which receives its own fugacity. In graph-theoretic language, the partition functi…
Asymptotic size of the Karp-Sipser Core in Configuration Model
Arnab Chatterjee, Joon Hyung Lee, Haodong Zhu
We study the asymptotic size of the Karp-Sipser core in the configuration model with arbitrary degree distributions. The Karp-Sipser core is the induced subgraph obtained by iterat…
Quantum Physics using Weighted Model Counting
Dirck van den Ende, Joon Hyung Lee, Alfons Laarman +1
Weighted model counting (WMC) has proven effective at a range of tasks within computer science, physics, and beyond. However, existing approaches for using WMC in quantum physics o…
Counting homomorphisms in antiferromagnetic graphs via Lorentzian polynomials
Joonkyung Lee, Jaeseong Oh, Jaehyeon Seo
An edge-weighted graph , possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The num…
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Abbas Mehrabian, Ankit Anand, Hyunjik Kim +16
This work studies a central extremal graph theory problem inspired by a 1975 conjecture of Erdős, which aims to find graphs with a given size (number of nodes) that maximize the nu…