SearcharxivSearch

arXiv · 2409.00542

Tail Bounds for Functions of Weighted Tensor Sums Derived from Random Walks on Riemannian Manifolds

Abstract

This paper presents significant advancements in tensor analysis and the study of random walks on manifolds. It introduces new tensor inequalities derived using the Mond-Pecaric method, which enriches the existing mathematical tools for tensor analysis. This method, developed by mathematicians Mond and Pecaric, is a powerful technique for establishing inequalities in linear operators and matrices, using functional analysis and operator theory principles. The paper also proposes novel lower and upper bounds for estimating column sums of transition matrices based on their spectral information, which is critical for understanding random walk behavior. Additionally, it derives bounds for the right tail of weighted tensor sums derived from random walks on manifolds, utilizing the spectrum of the Laplace-Beltrami operator over the underlying manifolds and new tensor inequalities to enhance the understanding of these complex mathematical structures.

Explore related subjects

Keep this discovery

BibTeXRIS

Shih-Yu Chang. 2024-08-31. Tail Bounds for Functions of Weighted Tensor Sums Derived from Random Walks on Riemannian Manifolds. https://arxiv.org/abs/2409.00542

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