1 citations · 1 across the 8 of their papers we have counts for
9 papers
On Counting Independent Sets in Regular Hypergraphs
Michail Sarantis, Prasad Tetali, Zeyu Zheng
Balogh, Bollobás and Narayanan conjectured that among all finite simple -uniform -regular hypergraphs, the number of weak independent sets is maximized by a natural quasi-bip…
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…
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…
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…
Percolation on hypergraphs and the hard-core model
Tyler Helmuth, Will Perkins, Michail Sarantis
We prove tight bounds on the site percolation threshold for -uniform hypergraphs of maximum degree and for -uniform hypergraphs of maximum degree in which any pair of…
Note on the number of antichains in generalizations of the Boolean lattice
Jinyoung Park, Michail Sarantis, Prasad Tetali
We give a short and self-contained argument that shows that, for any positive integers and with , the number of antichains of t…
Discrepancies of subtrees
Tarun Krishna, Peleg Michaeli, Michail Sarantis +2
We study multicolour, oriented and high-dimensional discrepancies of the set of all subtrees of a tree. As our main result, we show that the -colour discrepancy of the subtrees…
On the zeroes of hypergraph independence polynomials
David Galvin, Gwen McKinley, Will Perkins +2
We study the locations of complex zeroes of independence polynomials of bounded degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical phys…
On the Number of Independent Sets in Uniform, Regular, Linear Hypergraphs
Emma Cohen, Will Perkins, Michail Sarantis +1
We study the problems of bounding the number weak and strong independent sets in -uniform, -regular, -vertex linear hypergraphs with no cross-edges. In the case of weak in…