A Hard-Core Model on a Cayley Tree: An Example of a Loss Network
Queueing Systems: Theory and Applications
Fast mixing for independent sets, colorings and other models on trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Counting without sampling: new algorithms for enumeration problems using statistical physics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast mixing for independent sets, colorings, and other models on trees
Random Structures & Algorithms
Random Structures & Algorithms
Reconstruction threshold for the hardcore model
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Phase transition for Glauber dynamics for independent sets on regular trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We determine the approximate value of a critical activity for the hard-core model on the Bethe lattice, which determines whether the unique simple invariant Gibbs measure is extremal. This “recovery threshold” turns out to be different both from the threshold for unique Gibbs measure and (in contrast to the Ising model) from the threshold for recovery of root information using only statistical information about distant sites. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004