The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  1. D. Aldous and J. Fill. Reversible Markov Chains. To appear.
  2. R. Burton and R. Pemantle. Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances. Ann. Probab. 21 (1993), no. 3, 1329--1371. Math. Review 94m:60019
  3. G.F. Lawler. Loop-erased random walk. Perplexing Problems in Probability, Birkhauser-Boston (1999), 197--217.
  4. I. Benjamini, R. Lyons, Y. Peres and O. Schramm. Uniform spanning forests. To appear, Ann Probab.
  5. G. Kirchhoff. Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Ann. Phys. Chem. 72 (1847) 497--08.
  6. R. Kenyon. The asymptotic determinant of the discrete Laplacian. Preprint (1999).
  7. R. Lyons and Y. Peres. Probability on Trees and Networks. To appear.
  8. J.G. Propp and D.B. Wilson. How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. 7th Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996). J. Algorithms 27 (1998), no. 2, 170--217. Math. Review 99g:60116
  9. E. Seneta. (1973). Non-negative matrices and Markov chains. Springer. Math. Review 85i:60058
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.