On the Widom-Rowlinson occupancy fraction in regular graphs
Research output: Contribution to journal › Article › peer-review
Colleges, School and Institutes
We consider the Widom–Rowlinson model of two types of interacting particles on d-regular graphs. We prove a tight upper bound on the occupancy fraction, the expected fraction of vertices occupied by a particle under a random configuration from the model. The upper bound is achieved uniquely by unions of complete graphs on d + 1 vertices, Kd+1. As a corollary we find that Kd+1 also maximizes the normalized partition function of the Widom–Rowlinson model over the class of d-regular graphs. A special case of this shows that the normalized number of homomorphisms from any d-regular graph G to the graph HWR, a path on three vertices with a loop on each vertex, is maximized by Kd+1. This proves a conjecture of Galvin.
|Journal||Combinatorics, Probability and Computing|
|Early online date||9 Aug 2016|
|Publication status||E-pub ahead of print - 9 Aug 2016|