1. Aizenman, M., Kesten, H. and Newman, C.M. (1987) Uniqueness of the infinite cluster and continuity of connectivity functions for short- and long-range percolation, Comm. Math. Phys. 128, 39–55.
2. Aldous, D. (1990) The random walk construction of uniform spanning trees and uniform labelled trees, SIAM J. Discrete Math. 3, 450–465.
3. Aldous, D. and Lyons, R. (2007) Processes on unimodular random networks, Electr. J.Probab. 12, 1454–1508.
4. Alexander, K.S. (1995) Percolation and minimal spanning forests in infinite graphs, Ann. Probab. 23, 87–104.
5. Babai, L. (1997) The growth rate of vertex-transitive planar graphs, in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA, 1997), pp 564–573, ACM, New York.