Open Access
2019 Weighted graphs and complex Gaussian free fields
Gregory F. Lawler, Petr Panov
Electron. Commun. Probab. 24: 1-9 (2019). DOI: 10.1214/19-ECP225

Abstract

We prove a combinatorial statement about the distribution of directed currents in a complex “loop soup” and use it to give a new proof of the isomorphism, which relates loop measures and complex Gaussian free fields.

Citation

Download Citation

Gregory F. Lawler. Petr Panov. "Weighted graphs and complex Gaussian free fields." Electron. Commun. Probab. 24 1 - 9, 2019. https://doi.org/10.1214/19-ECP225

Information

Received: 7 June 2018; Accepted: 2 April 2019; Published: 2019
First available in Project Euclid: 22 June 2019

zbMATH: 07088979
MathSciNet: MR3978687
Digital Object Identifier: 10.1214/19-ECP225

Subjects:
Primary: 60J05

Keywords: Gaussian free field , isomorphism theorem , random walk loop soup

Back to Top