On phase transition in the hard-core model on ℤ d

Combinatorics Probability and Computing

Volumn 13, Issue 2, 2004, Pages 137-164

  Galvin, David ^a,b   Kahn, Jeff ^a  

^a RUTGERS UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL APPLICATIONS; HARD-CORE MODELS; INDEPENDENT SETS; ODD VERTICES;

BOUNDARY CONDITIONS; GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY; STATISTICAL MECHANICS; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

PHASE TRANSITIONS;

EID: 3142729349     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303006035     Document Type: Article

References (26)

1. van den Berg, J. and Steif, J. E. (1994) Percolation and the hard-core lattice gas model. Stoch. Proc. Appl. 49 179-197.
2. Bollobás, B. (1998) Modern Graph Theory, Springer, New York.
3. Bollobás, B. and Leader, I. (1990) An isoperimetric inequality on the discrete torus. SIAM J. Discrete Math. 3 32-37.
4. Brightwell, G. R., Häggström, O. and Winkler, P. (1999) Nonmonotonic behavior in the hard-core and Widom-Rowlinson models. J. Statist. Phys. 94 415-435.
5. Diestel, R. (2000) Graph Theory, Springer, New York.
6. Dobrushin, R. L. (1968) The problem of uniqueness of a Gibbs random field and the problem of phase transition. Functional Anal. Appl. 2 302-312.
7. Füredi, Z. (1988) Matchings and covers in hypergraphs. Graphs Combin. 4 115-206.
8. Georgii, H.-O. (1988) Gibbs Measures and Phase Transitions, de Gruyter, Berlin.
9. Grimmett, G. (1999) Percolation, Springer, Berlin.
10. 2 with parity-dependent activities. Ark. Mat. 35 171-184.
11. Kahn, J. (2000) Asymptotics of the list-chromatic index for multigraphs. Random Struct. Alg. 17 117-156.
12. Kahn, J. (2001) An entropy approach to the hard-core model on bipartite graphs. Combin. Probab. Comput. 10 219-237.
13. Kahn, J. (2001) Entropy, independent sets and antichains: A new approach to Dedekind's Problem. Proc. Amer. Math. Soc. 130 371-378.
14. Kahn, J. and Kayll, P. M. (1997) Fractional vs. integer covers in hypergraphs of bounded edge size. J. Combin. Theory Ser. A 78 199-235.
15. Knuth, D. (1969) The Art of Computer Programming, Vol. I, Addison-Wesley, London.
16. Korshunov, A. D. (1980) The number of monotone Boolean functions. Problemy Kibernet. 38 5-108. (Russian.)
17. Korshunov, A. D. and Sapozhenko, A. A. (1983) The number of binary codes with distance 2. Problemy Kibernet. 40 111-130. (Russian.)
18. Louth, G. M. (1990) Stochastic networks: Complexity, dependence and routing. Thesis, Cambridge University.
19. Lovász, L. (1975) On the ratio of optimal integral and fractional covers. Discrete Math. 13 383-390.
20. Sapozhenko, A. A. (1987) On the number of connected subsets with given cardinality of the boundary in bipartite graphs. Metody Diskret. Analiz. 45 42-70. (Russian.)
21. Sapozhenko, A. A. (1989) The number of antichains in ranked partially ordered sets. Diskret. Mat. 1 74-93. (Russian; translation in Discrete Math. Appl. 1 (1991) 35-58.)
22. Sapozhenko, A. A. (1989) The number of antichains in ranked partially ordered sets. Diskret. Mat. 1 74-93. (Russian; translation in Discrete Math. Appl. 1 (1991) 35-58.)
23. Sapozhenko, A. A. (1989) The number of antichains in multilevelled ranked sets. Diskret. Mat. 1 110-128. (Russian; translation in Discrete Math. Appl. 1 (1991) 149-169.)
24. Sapozhenko, A. A. (1989) The number of antichains in multilevelled ranked sets. Diskret. Mat. 1 110-128. (Russian; translation in Discrete Math. Appl. 1 (1991) 149-169.)
25. Stein, S. K. (1974) Two combinatorial covering theorems. J. Combin. Theory Ser. A 16 391-397.
26. Wang, D. and Wang, P. (1977) Discrete isoperimetric problems. SIAM J. Appl. Math. 32 860-870.