Search arXivSearch

arXiv · 1206.0371

Random determinants, mixed volumes of ellipsoids, and zeros of Gaussian random fields

Abstract

Consider a $d\times d$ matrix $M$ whose rows are independent centered non-degenerate Gaussian vectors $ξ_1,...,ξ_d$ with covariance matrices $Σ_1,...,Σ_d$. Denote by $\mathcal{E}_i$ the location-dispersion ellipsoid of $ξ_i:\mathcal{E}_i={\mathbf{x}\in\mathbb{R}^d : \mathbf{x}^\topΣ_i^{-1} \mathbf{x}\leqslant1}$. We show that $$ \mathbb{E}\,|\det M|=\frac{d!}{(2π)^{d/2}}V_d(\mathcal{E}_1,...,\mathcal{E}_d), $$ where $V_d(\cdot,...,\cdot)$ denotes the {\it mixed volume}. We also generalize this result to the case of rectangular matrices. As a direct corollary we get an analytic expression for the mixed volume of $d$ arbitrary ellipsoids in $\mathbb{R}^d$. As another application, we consider a smooth centered non-degenerate Gaussian random field $X=(X_1,...,X_k)^\top:\mathbb{R}^d\to\mathbb{R}^k$. Using Kac-Rice formula, we obtain the geometric interpretation of the intensity of zeros of $X$ in terms of the mixed volume of location-dispersion ellipsoids of the gradients of $X_i/\sqrt{\mathbf{Var} X_i}$. This relates zero sets of equations to mixed volumes in a way which is reminiscent of the well-known Bernstein theorem about the number of solutions of the typical system of algebraic equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zakhar Kabluchko, Dmitry Zaporozhets. 2012-06-02. Random determinants, mixed volumes of ellipsoids, and zeros of Gaussian random fields. https://arxiv.org/abs/1206.0371

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

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR