Papers
Topics
Authors
Recent
2000 character limit reached

A universality result for subcritical Complex Gaussian Multiplicative Chaos

Published 31 Mar 2020 in math.PR, math-ph, and math.MP | (2003.14024v3)

Abstract: In the present paper, we show that (under some minor technical assumption) Complex Gaussian Multiplicative Chaos defined as the complex exponential of a $\log$-correlated Gaussian field can be obtained by taking the limit of the exponential of the field convoluted with a smoothing Kernel. We consider two types of chaos: $e{\gamma X}$ for a log correlated field $X$ and $\gamma=\alpha+i\beta$, $\alpha, \beta\in \mathbb R$ and $e{\alpha X+i\beta Y}$ for $X$ and $Y$ two independent fields with $\alpha, \beta\in \mathbb R$. Our result is valid in the range $$ \mathcal O_{\mathrm{sub}}:={ \alpha2+\beta2<d } \cup { |\alpha|\in (\sqrt{d/2},\sqrt{2d} ) \text{ and } |\beta|< \sqrt{2d}-|\alpha| },$$ which, up to boundary, is conjectured to be optimal.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.