Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 86 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 43 tok/s
GPT-5 High 37 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 466 tok/s Pro
Kimi K2 225 tok/s Pro
2000 character limit reached

A universality result for subcritical Complex Gaussian Multiplicative Chaos (2003.14024v3)

Published 31 Mar 2020 in math.PR, math-ph, and math.MP

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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)