RESUMO
We study the 'critical moments' of subcritical Gaussian multiplicative chaos (GMCs) in dimensions d ≤ 2 . In particular, we establish a fully explicit formula for the leading order asymptotics, which is closely related to large deviation results for GMCs and demonstrates a similar universality feature. We conjecture that our result correctly describes the behaviour of analogous moments of moments of random matrices, or more generally structures which are asymptotically Gaussian and log-correlated in the entire mesoscopic scale. This is verified for an integer case in the setting of circular unitary ensemble, extending and strengthening the results of Claeys et al. and Fahs to higher-order moments.
RESUMO
We present a novel mathematical model that seeks to capture the key design feature of generative adversarial networks (GANs). Our model consists of two interacting spin glasses, and we conduct an extensive theoretical analysis of the complexity of the model's critical points using techniques from Random Matrix Theory. The result is insights into the loss surfaces of large GANs that build upon prior insights for simpler networks, but also reveal new structure unique to this setting which explains the greater difficulty of training GANs.
RESUMO
We establish a connection between the conjectural two-over-two ratios formula for the Riemann zeta-function and a conjecture concerning correlations of a certain arithmetic function. Specifically, we prove that the ratios conjecture and the arithmetic correlations conjecture imply the same result. This casts a new light on the underpinnings of the ratios conjecture, which previously had been motivated by analogy with formulae in random matrix theory and by a heuristic recipe.
RESUMO
We examine the calculation of the second and fourth moments and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. Previously, this approach has proved unsuccessful in computing moments beyond the eighth, even heuristically. A careful analysis of the second and fourth moments illustrates the nature of the problem and enables us to identify the terms that are missed in the standard application of these methods.
RESUMO
We argue that the freezing transition scenario, previously conjectured to occur in the statistical mechanics of 1/f-noise random energy models, governs, after reinterpretation, the value distribution of the maximum of the modulus of the characteristic polynomials pN(θ) of large N×N random unitary (circular unitary ensemble) matrices UN; i.e. the extreme value statistics of pN(θ) when N â ∞. In addition, we argue that it leads to multi-fractal-like behaviour in the total length µN(x) of the intervals in which |pN(θ)|>N(x), x>0, in the same limit. We speculate that our results extend to the large values taken by the Riemann zeta function ζ(s) over stretches of the critical line s = 1/2 + it of given constant length and present the results of numerical computations of the large values of ζ(1/2 + it). Our main purpose is to draw attention to the unexpected connections between these different extreme value problems.
RESUMO
We argue that the freezing transition scenario, previously explored in the statistical mechanics of 1/f-noise random energy models, also determines the value distribution of the maximum of the modulus of the characteristic polynomials of large N×N random unitary matrices. We postulate that our results extend to the extreme values taken by the Riemann zeta function ζ(s) over sections of the critical line s=1/2+it of constant length and present the results of numerical computations in support. Our main purpose is to draw attention to possible connections between the statistical mechanics of random energy landscapes, random-matrix theory, and the theory of the Riemann zeta function.