An elementary approach to Gaussian multiplicative chaos
Electronic Communications in Probability · 01.01.2017 · 22 (none) · 1-12
DOI: 10.1214/17-ecp58 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Communications in Probability, erschienen am 01.01.2017. Verfasst von Nathanaël Berestycki. Die Arbeit wurde bisher 136-mal zitiert (Crossref) und nennt 16 Literaturangaben.
Abstract (Originalsprache)
A completely elementary and self-contained proof of convergence of Gaussian multiplicative chaos is given. The argument shows further that the limiting random measure is nontrivial in the entire subcritical phase $(\gamma < \sqrt{2d} )$ and that the limit is universal (i.e., the limiting measure is independent of the regularisation of the underlying field).
Zitieren
APA
Berestycki, N. (2017). An elementary approach to Gaussian multiplicative chaos. Electronic Communications in Probability, 22(none), 1-12. https://doi.org/10.1214/17-ecp58
Vancouver
Berestycki N. An elementary approach to Gaussian multiplicative chaos. Electronic Communications in Probability. 2017;22(none):1-12. doi:10.1214/17-ecp58
BibTeX
@article{Berestycki2017,
author = {Berestycki, Nathanaël},
title = {An elementary approach to Gaussian multiplicative chaos},
journal = {Electronic Communications in Probability},
year = {2017},
volume = {22},
number = {none},
pages = {1--12},
doi = {10.1214/17-ecp58}
}
EUVIMED