Asymptotic enumeration of spanning trees

Combinatorics Probability and Computing

Volumn 14, Issue 4, 2005, Pages 491-522

  Lyons, Russell ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; LAPLACE TRANSFORMS; MATRIX ALGEBRA; NUMBER THEORY; THEOREM PROVING;

EIGENVALUES; INFINITE GRAPHS; METRIC ENTROPY; SPANNING TREES;

TREES (MATHEMATICS);

EID: 23844524256     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830500684X     Document Type: Article

References (47)

1. Aldous, D. (1998) Tree-valued Markov chains and Poisson-Galton-Watson distributions. In Microsurveys in Discrete Probability (D. Aldous and J. Propp, eds), Vol. 41 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., AMS, Providence, RI, pp. 1-20.
2. Aldous, D. J. and Lyons, R. (2004) Processes on unimodular random networks. In preparation.
3. Aldous, D. J. and Steele, J. M. (2004) The objective method: Probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures (H. Kesten, ed.), Vol. 110 of Encyclopaedia Math. Sci. Springer, pp. 1-72.
4. Barlow, M., Coulhon, T. and Grigor'yan, A. (2001) Manifolds and graphs with slow heat kernel decay. Invent. Math. 144 609-649.
5. Benjamini, I. and Schramm, O. (2001) Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6 # 23 (electronic).
6. Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (1999) Group-invariant percolation on graphs. Geom. Funct. Anal. 9 29-66.
7. Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (2001) Uniform spanning forests. Ann. Probab. 29 1-65.
8. Bhatia, R. (1997) Matrix Analysis, Vol. 169 of Graduate Texts in Mathematics, Springer, New York.
9. Bollobás, B. (1998) Modern Graph Theory, Vol. 184 of Graduate Texts in Mathematics, Springer, New York.
10. Bollobás, B. (2001) Random Graphs, Vol. 73 of Cambridge Studies in Advanced Mathematics, second edition, Cambridge University Press, Cambridge.
11. Burton, R. M. and Pemantle, R. (1993) Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances. Ann. Probab. 21 1329-1371.
12. Carlen, E. A., Kusuoka, S. and Stroock, D. W. (1987) Upper bounds for symmetric Markov transition functions. Ann. Inst. H. Poincaré Probab. Statist. 23 245-287.
13. Chung, F. R. K. (1996) Laplacians of graphs and Cheeger's inequalities. In Combinatorics, Paul Erdös is Eighty, Vol. 2, (D. Miklós, V. T. Sós and T. Szönyi, eds)
14. Vol. 2 of Bolyai Soc. Math. Stud., János Bolyai Math. Soc., Budapest, pp. 157-172.
15. Coulhon, T. (2000) Random walks and geometry on infinite graphs. In Lecture Notes on Analysis on Metric Spaces, Trento, CIRM, 1999 (L. Ambrosio and F. S. Cassano, eds), Scuola Normale Superiore di Pisa, pp. 5-30.
16. Dudley, R. M. (1989) Real Analysis and Probability, Wadsworth & Brooks/Cole Advanced Books & Software, Pacific Grove, CA.
17. Feder, T. and Mihail, M. (1992) Balanced matroids. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 26-38.
18. Felker, J. L. and Lyons, R. (2003) High-precision entropy values for spanning trees in lattices. J. Phys. A 36 8361-8365.
19. Fuglede, B. and Kadison, R. V. (1952) Determinant theory in finite factors. Ann. of Math. 55 520-530.
20. Godsil, C. and Royle, G. (2001) Algebraic Graph Theory, Vol. 207 of Graduate Texts in Mathematics, Springer, New York.
21. Grenander, U. and Szegö, G. (1984) Toeplitz Forms and Their Applications, second edition, Chelsea Publishing Co., New York.
22. Grimmett, G. R. (1980/81) Random labelled trees and their branching networks. J. Austral. Math. Soc. Ser. A 30 229-237.
23. Häggström, O. (1995) Random-cluster measures and uniform spanning trees. Stochastic Process. Appl. 59 267-275.
24. Häggström, O. (1998) Uniform and minimal essential spanning forests on trees. Random Struct. Alg. 12 27-50.
25. Helson, H. and Lowdenslager, D. (1958) Prediction theory and Fourier series in several variables. Acta Math. 99 165-202.
26. Kesten, H. (1959) Symmetric random walks on groups. Trans. Amer. Math. Soc. 92 336-354.
27. Kieffer, J. C. (1975) A generalized Shannon-McMillan theorem for the action of an amenable group on a probability space. Ann. Probab. 3, 1031-1037.
28. Lind, D. and Tuncel, S. (2001) A spanning tree invariant for Markov shifts. In Codes, Systems, and Graphical Models (Minneapolis, MN, 1999) (B. Marcus and J. Rosenthal, eds), Vol. 123 of IMA Vol. Math. Appl., Springer, New York, pp. 487-497.
29. Löwner, K. (1934) Über monotone Matrixfunktionen. Math. Z. 38 177-216.
30. Lyons, R. (1998) A bird's-eye view of uniform spanning trees and forests. In Microsurveys in Discrete Probability (D. Aldous and J. Propp, eds), Vol. 41 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Providence, RI, pp. 135-162.
31. Lyons, R. and Steif, J. E. (2003) Stationary determinantal processes: Phase multiplicity, Bernoullicity, entropy, and domination. Duke Math. J. 120 515-575.
32. McKay, B. D. (1981) Spanning trees in random regular graphs. In Proceedings of the Third Caribbean Conference on Combinatorics and Computing (C. C. Cadogan, ed.), pp. 139-143.
33. McKay, B. D. (1983) Spanning trees in regular graphs. Europ. J. Combin. 4 149-160.
34. Morris, B. and Peres, Y. (2004) Evolving sets, mixing and heat kernel bounds. Probab. Theory Rel. Fields, to appear.
35. Ornstein, D. S. and Weiss, B. (1987) Entropy and isomorphism theorems for actions of amenable groups. J. Analyse Math. 48 1-141.
36. Pemantle, R. (1991) Choosing a spanning tree for the integer lattice uniformly. Ann. Probab. 19 1559-1574.
37. Runge, F. and Sachs, H. (1974) Berechnung der Anzahl der Gerüste von Graphen und Hypergraphen mittels deren Spektren. In Papers presented at the Fifth Balkan Mathematical Congress, Vol. 4, Beogradski Izdavačko-Grafički Zavod, Belgrade, pp. 529-536.
38. Math. Balkanica 4 (1974).
39. Saloff-Coste, L. (1995) Isoperimetric inequalities and decay of iterated kernels for almosttransitive Markov chains. Combin. Probab. Comput. 4 419-442.
40. Saloff-Coste, L. (1997) Lectures on finite Markov chains. In Lectures on Probability Theory and Statistics (Saint-Flour, 1996) (P. Bernard, ed.), Vol. 1665 of Lecture Notes in Math., Springer, Berlin, pp. 301-413.
41. Salvatori, M. (1992) On the norms of group-invariant transition operators on graphs. J. Theoret. Probab. 5 563-576.
42. Sheffield, S. (2003) Random surfaces: Large deviations principles and gradient Gibbs measure classifications. PhD thesis, Stanford University.
43. Shrock, R. and Wu, F. Y. (2000). Spanning trees on graphs and lattices in d dimensions. J. Phys. A 33 3881-3902.
44. Soardi, P. M. and Woess, W. (1990) Amenability, unimodularity, and the spectral radius of random walks on infinite graphs. Math. Z. 205 471-486.
45. Strassen, V. (1965) The existence of probability measures with given marginals. Ann. Math. Statist. 36 423-439.
46. Woess, W. (1984) A random walk on free products of finite groups. In Probability Measures on Groups VII (Oberwolfach, 1983) (H. Heyer, ed.), Vol. 1064 of Lecture Notes in Mathematics, Springer, Berlin, pp. 467-470.
47. Woess, W. (2000) Random Walks on Infinite Graphs and Groups, Vol. 138 of Cambridge Tracts in Mathematics, Cambridge University Press, Cambridge.