SearcharxivSearch

arXiv · 2308.06478

Tail bounds for Multivariate Random Tensor Means

Abstract

In our recent research endeavors, we have delved into the realm of tail bounds problems concerning bivariate random tensor means. In this context, tensors are treated as finite-dimensional operators. However, the longstanding challenge of extending the concept of operator means to scenarios involving more than two variables had persisted. The primary objective of this present study is to unveil a collection of tail bounds applicable to multivariate random tensor means. These encompass the weighted arithmetic mean, weighted harmonic mean, and the Karcher mean. These bounds are derived through the utilization of Ando-Hiai's inequalities, alongside tail bounds specifically tailored for multivariate random tensor means employing reverse Ando-Hiai's inequalities, which are rooted in Kantorovich constants. Notably, our methodology involves employing the concept of deformation for operator means with multiple variables, following the principles articulated in Hiai, Seo and Wada's recent work. Additionally, our research contributes to the expansion about the Karcher mean differentiable region from the vicinity of the diagonal identity element within the Cartesian product space of positive definite tensors to the vicinity of the general element within the Cartesian product space of positive definite tensors via the application of the inverse and implicit function theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Shih-Yu Chang. 2023-08-12. Tail bounds for Multivariate Random Tensor Means. https://arxiv.org/abs/2308.06478

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