[1]
Achlioptas, D. and Naor, A. (2005) The two possible values of the chromatic number of a random graph.
Ann. of Math.
162
1333–1349.

[2]
Achlioptas, D. and Peres, Y. (2004) The threshold for random *k*-SAT is 2^{
k
} log 2 - *O(k)*.
J. Amer. Math. Soc.
17
947–973.

[3]
Beffara, V. and Duminil-Copin, H. (2012) The self-dual point of the two-dimensional random cluster model is critical for *q* ⩾ 1.
Probab. Theory Rel. Fields
153
511–542.

[4]
de Bruijn, N. G. (1981) Asymptotic Methods in Analysis, Dover.

[5]
Cai, J.-Y., Galanis, A., Goldberg, L. A., Guo, H., Jerrum, M., Štefankovič, D. and Vigoda, E. (2014) #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. In *Proc. 18th International Workshop on Randomization and Computation* (RANDOM), pp. 582–595.

[6]
Dembo, A., Montanari, A. and Sun, N. (2013) Factor models on locally tree-like graphs.
Ann. Probab.
41
4162–4213.

[7]
Dyer, M., Frieze, A. M. and Jerrum, M. (2002) On counting independent sets in sparse graphs.
SIAM J. Comput.
31
1527–1541.

[8]
Galanis, A., Ge, Q., Štefankovič, D., Vigoda, E. and Yang, L. (2014) Improved inapproximability results for counting independent sets in the hard-core model.
Random Struct. Alg.
45
78–110.

[9]
Galanis, A., Štefankovič, D. and Vigoda, E. (2012) Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. arXiv.org:1203.2226

[10]
Galanis, A., Štefankovič, D. and Vigoda, E. (2014) Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. In *Proc. 46th Annual ACM Symposium on Theory of Computing* (STOC). **62** pp. 823–831. http://dl.acm.org/citation.cfm?doid=2785964
[11]
Georgii, H.-O. (1988)
*Gibbs Measures and Phase Transitions*
, Vol. 9 of De Gruyter Studies in Mathematics, Walter de Gruyter.

[12]
Goldberg, L. A., Jerrum, M. and Paterson, M. (2003) The computational complexity of two-state spin systems.
Random Struct. Alg.
23
133–154.

[13]
Greenhill, C. (2000) The complexity of counting colorings and independent sets in sparse graphs and hypergraphs.
Comput. Complexity
9
52–72.

[14]
Janson, S. (1995) Random regular graphs: Asymptotic distributions and contiguity.
Combin. Probab. Comput.
4
369–405.

[15]
Janson, S., Łuczak, T. and Rucinski, A. (2000) Random Graphs, Wiley-Interscience.

[16]
Jerrum, M. and Sinclair, A. (1993) Polynomial-time approximation algorithms for the Ising model.
SIAM J. Comput.
22
1087–1116.

[17]
Kelly, F. P. (1985) Stochastic models of computer communication systems.
J. Royal Statist. Soc. Ser. B
47
379–395.

[18]
Li, L., Lu, P. and Yin, Y. (2013) Correlation decay up to uniqueness in spin systems. In *Proc. 24th Annual ACM–SIAM Symposium on Discrete Algorithms* (SODA), pp. 47–66.

[19]
Martinelli, F., Sinclair, A. and Weitz, D. (2004) Glauber dynamics on trees: Boundary conditions and mixing time.
Comm. Math. Phys.
250
301–334.

[20]
Martinelli, F., Sinclair, A. and Weitz, D. (2007) Fast mixing for independent sets, colorings, and other models on trees.
Random Struct. Alg.
31
134–172.

[21]
Mezard, M. and Montanari, A. (2009) Information, Physics, and Computation, Oxford University Press.

[22]
Molloy, M., Robalewska, H., Robinson, R. W. and Wormald, N. C. (1997) 1-factorizations of random regular graphs.
Random Struct. Alg.
10
305–321.

[23]
Mossel, E. (2004) Survey: Information flow on trees. In *Graphs, Morphisms, and Statistical Physics*, Vol. 63 of *DIMACS Series in Discrete Mathematics and Theoretical Computer Science*, pp. 155–170.

[24]
Mossel, E., Weitz, D. and Wormald, N. (2009) On the hardness of sampling independent sets beyond the tree threshold.
Probab. Theory Rel. Fields
143
401–439.

[25]
Restrepo, R., Shin, J., Tetali, P., Vigoda, E. and Yang, L. (2013) Improved mixing condition on the grid for counting and sampling independent sets.
Probab. Theory Rel. Fields
156
75–99.

[26]
Sinclair, A., Srivastava, P. and Thurley, M. (2014) Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs.
J. Statist. Phys.
155
666–686.

[27]
Sly, A. (2010) Computational transition at the uniqueness threshold. In *Proc. 51st Annual IEEE Symposium on Foundations of Computer Science* (FOCS), pp. 287–296.

[28]
Sly, A. and Sun, N. (2014) The computational hardness of counting in two-spin models on *d*-regular graphs.
Ann. Probab.
42
2383–2416.

[29]
Talagrand, M. (2003) Spin Glasses: A Challenge for Mathematicians, Springer.

[30]
Valiant, L. G. (1979) The complexity of enumeration and reliability problems.
SIAM J. Comput.
8
410–421.

[31]
Weitz, D. (2006) Counting independent sets up to the tree threshold. In *Proc. 38th Annual ACM Symposium on Theory of Computing* (STOC), pp. 140–149.

[32]
Wormald, N. C. (1999) Models of random regular graphs. In Surveys in Combinatorics 1999 (Lamb, J. D. and Preece, D. A., eds), Cambridge University Press, pp. 239–298.

[33]
Zhang, J., Liang, H. and Bai, F. (2011) Approximating partition functions of two-state spin systems.
Inform. Process. Lett.
111
702–710.