Abstract
We use entropy ideas to study hard-core distributions on the independent sets of a finite,
regular bipartite graph, specifically distributions according to which each independent
set I is chosen with probability proportional to λ[mid ]I[mid ]
for some fixed λ > 0. Among the
results obtained are rather precise bounds on occupation probabilities; a ‘phase transition’
statement for Hamming cubes; and an exact upper bound on the number of independent
sets in an n-regular bipartite graph on a given number of vertices.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献