SearcharxivSearch

arXiv · 1604.04381

The Sine$_\beta$ operator

Abstract

We show that Sine$_\beta$, the bulk limit of the Gaussian $\beta$-ensembles is the spectrum of a self-adjoint random differential operator \[ f\to 2 {R_t^{-1}} \left[ \begin{array}{cc} 0 &-\tfrac{d}{dt} \tfrac{d}{dt} &0 \end{array} \right] f, \qquad f:[0,1)\to \mathbb R^2, \] where $R_t$ is the positive definite matrix representation of hyperbolic Brownian motion with variance $4/\beta$ in logarithmic time. The result connects the Montgomery-Dyson conjecture about the Sine$_2$ process and the non-trivial zeros of the Riemann zeta function, the Hilbert-P\'olya conjecture and de Brange's attempt to prove the Riemann hypothesis. We identify the Brownian carousel as the Sturm-Liouville phase function of this operator. We provide similar operator representations for several other finite dimensional random ensembles and their limits: finite unitary or orthogonal ensembles, Hua-Pickrell ensembles and their limits, hard-edge $\beta$-ensembles, as well as the Schr\"odinger point process. In this more general setting, hyperbolic Brownian motion is replaced by a random walk or Brownian motion on the affine group. Our approach provides a unified framework to study $\beta$-ensembles that has so far been missing in the literature. In particular, we connect It\^o's classification of affine Brownian motions with the classification of limits of random matrix ensembles.

Explore related subjects

Keep this discovery

BibTeXRIS

Benedek Valkó, Bálint Virág. 2016-04-15. The Sine$_\beta$ operator. https://doi.org/10.1007/s00222-016-0709-x

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR