Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.03301 v1 pith:EEWYY3RY submitted 2023-05-05 math.PR math.OA

classification math.PRmath.OA
keywords tensorrandombivariateboundsfunctionsinequalitiesmeanstail
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this work, we apply the concept about operator connection to consider bivariate random tensor means. We first extend classical Markov and Chebyshev inequalities from a random variable to a random tensor by establishing Markov inequality for tensors and Chebyshev inequality for tensors. These inequalities are applied to establish tail bounds for bivariate random tensor means represented by operator perspectives based on various types of connection functions: tensor increasing functions, tensor decreasing functions, and tensor concavity functions. We also consider tail bounds relations for the summation and product of eigenvalues based on majorization ordering of eigenvalues of bivariate random tensor means. This is Part I of our work about random tensor inequalities and tail bounds for bivariate random tensor mean. In our Part II, we will consider bivariate random tensor mean with respect to non-invertible random tensors and their applications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Matrix Ordering through Spectral and Nilpotent Structures in Totally Ordered Complex Number Fields

    math.FA 2025-01 reject novelty 4.0 of 10

    The paper defines a lexicographic total order on complex numbers and a Spectral and Nilpotent Ordering (SNO) for arbitrary matrices, claiming to extend majorization, Schur-Ostrowski, and operator convexity results to ...

Pith tools