3 papers
math.CO2026
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…
math.CO2026
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…
math.CO2026
On the number of antichains in
Matthew Jenssen, Jinyoung Park, Michail Sarantis
We provide precise asymptotics for the number of antichains in the poset , answering a question of Sapozhenko. Finding improved estimates for this number was also a pr…