SearcharxivSearch

arXiv · 0903.1433

Positive definite functions and multidimensional versions of random variables

Abstract

We say that a random vector $X=(X_1,...,X_n)$ in $R^n$ is an $n$-dimensional version of a random variable $Y$ if for any $a\in R^n$ the random variables $\sum a_iX_i$ and $γ(a) Y$ are identically distributed, where $γ:R^n\to [0,\infty)$ is called the standard of $X.$ An old problem is to characterize those functions $γ$ that can appear as the standard of an $n$-dimensional version. In this paper, we prove the conjecture of Lisitsky that every standard must be the norm of a space that embeds in $L_0.$ This result is almost optimal, as the norm of any finite dimensional subspace of $L_p$ with $p\in (0,2]$ is the standard of an $n$-dimensional version ($p$-stable random vector) by the classical result of P.Lèvy. An equivalent formulation is that if a function of the form $f(\|\cdot\|_K)$ is positive definite on $R^n,$ where $K$ is an origin symmetric star body in $R^n$ and $f:R\to R$ is an even continuous function, then either the space $(R^n,\|\cdot\|_K)$ embeds in $L_0$ or $f$ is a constant function. Combined with known facts about embedding in $L_0,$ this result leads to several generalizations of the solution of Schoenberg's problem on positive definite functions.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Koldobsky. 2009-03-08. Positive definite functions and multidimensional versions of random variables. https://arxiv.org/abs/0903.1433

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