Advertisement

Loop Measures and the Gaussian Free Field

  • Gregory F. LawlerEmail author
  • Jacob Perlman
Chapter
  • 1.5k Downloads
Part of the Lecture Notes in Mathematics book series (LNM, volume 2144)

Abstract

Loop measures and their associated loop soups are generally viewed as arising from finite state Markov chains. We generalize several results to loop measures arising from potentially complex edge weights. We discuss two applications: Wilson’s algorithm to produce uniform spanning trees and an isomorphism theorem due to Le Jan.

Keywords

Span Tree Continuous Time Markov Chain Path Measure Loop Measure Gamma Random Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

This research was supported by National Science Foundation grant DMS-0907143.

The authors would like to thank Dapeng Zhan for bringing an error in an earlier version of this paper to our attention.

References

  1. 1.
    D. Brydges, J. Fröhlich, T. Spencer, The random walk representation of classical spin systems and correlations inequalities. Commun. Math. Phys. 83, 123–190 (1982)CrossRefGoogle Scholar
  2. 2.
    D. Brydges, J. Imbrie, G. Slade, Functional integral representations for self-avoiding walk. Probab. Surv. 6, 34–61 (2009)zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    E.B. Dynkin, Markov processes as a tool in field theory. J. Funct. Anal. 50, 167–187 (1983)zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    G. Lawler, The probability that loop-erased random walk uses a given edge. Electron. Commun. Probab. 19, Article no. 51 (2014)Google Scholar
  5. 5.
    G. Lawler, V. Limic, Random Walk: A Modern Introduction. Cambridge Studies in Advanced Mathematics, vol. 123 (Cambridge University Press, Cambridge, 2010)Google Scholar
  6. 6.
    G. Lawler, J. Trujillo Ferreras, Random walk loop soup. Trans. Am. Math. Soc. 359(2), 767–787 (2007)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    G. Lawler, W. Werner, The Brownian loop soup. Probab. Theory Relat. Fields 128(4), 565–588 (2004)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Y. Le Jan, Markov Paths, Loops, and Fields. Ecole e’Eté de Probabilités de St. Flour. Lecture Notes in Mathematics, vol. 2026 (Springer, Berlin, 2012)Google Scholar
  9. 9.
    K. Symanzik, Euclidean quantum field theory, in Scuola Internazionale di Fisica “Enrico Fermi”, XLV Coso (Academic, New York, 1969), pp. 152–223Google Scholar
  10. 10.
    D. Wilson, Generating random spanning trees more quickly than the cover time, in Proceedings of STOC96 (1996), pp. 296–303Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of ChicagoChicagoUSA

Personalised recommendations