SearcharxivSearch

arXiv · 2305.03305

Random Tensor Inequalities and Tail bounds for Bivariate Random Tensor Means, Part II

Abstract

This is Part II of our work about random tensor inequalities and tail bounds for bivariate random tensor means. After reviewing basic facts about random tensors, we first consider tail bounds with more general connection functions. Then, a general Lie-Trotter formula for tensors is derived and this formula is applied to establish tail bounds for bivariate random tensor means involving tensor logarithm. All random tensors studied in our Part I work are assumed as positive definite (PD) random tensors, which are invertible tensors. In this Part II work, we generalize our tail bounds for bivariate random tensor means from positive definite (PD) random tensors to positive semidefinite (PSD) random tensors by defining Random Tensor Topology (RTT) and developing the limitation method based on RTT. Finally, we apply our theory to establish tail bounds and L\"owner ordering relationships for bivariate random tensor means before and after two tensor data processing methods: data fusion and linear transform. %

Explore related subjects

Keep this discovery

BibTeXRIS

Shih-Yu Chang. 2023-05-05. Random Tensor Inequalities and Tail bounds for Bivariate Random Tensor Means, Part II. https://arxiv.org/abs/2305.03305

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