5 papers
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…
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…
Majority bootstrap percolation on the permutahedron and other high-dimensional graphs
MaurÃcio Collares, Joshua Erde, Anna Geisler +1
Majority bootstrap percolation is a model of infection spreading in networks. Starting with a set of initially infected vertices, new vertices become infected once half of their ne…
Counting independent sets in expanding bipartite regular graphs
MaurÃcio Collares, Joshua Erde, Anna Geisler +1
In this paper we provide an asymptotic expansion for the number of independent sets in a general class of regular, bipartite graphs satisfying some vertex-expansion properties, ext…
Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs
MaurÃcio Collares, Joshua Erde, Anna Geisler +1
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new ve…