Gap probabilities and applications to geometry and random topology

Antonio Lerario; Erik Lundberg

Home/Archive/arXiv

arXiv · 1309.5661

Gap probabilities and applications to geometry and random topology

Antonio Lerario·Erik Lundberg

View original source ↗Read source document ↗Export metadata ↓

Abstract

We give an exact formula for the value of the derivative at zero of the gap probability in finite n x n Gaussian ensembles. As n goes to infinity our computation provides an asymptotic (with an explicit constant) of the order n^(1/2). As a first application, we consider the set of n x n (Real, Complex or Quaternionic) Hermitian matrices with Frobenius norm one and determinant zero. We give an exact formula for the intrinsic volume of this set and as n goes to infinity its asymptotic (with an explicit constant) is of the order n^(1/2). As a second application we consider the problem of computing Betti numbers of an intersection of k random Kostlan quadrics in RP^n. We show that the i-th Betti number is asymptotically expected to be one (for i sufficiently away from n/2). In the case k=2 the the sum of all Betti numbers was recently shown by the first author to equal n+o(n). Here we sharpen this asymptotic proving an asymptotic with two orders of precision and explicit constants.

Explore related subjects

math.PR math.AG math.AT math.DG

Keep this discovery

BibTeX RIS

Antonio Lerario, Erik Lundberg. 2013-09-22. Gap probabilities and applications to geometry and random topology. https://arxiv.org/abs/1309.5661

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗