SearcharxivSearch

arXiv · 2211.10762

Continuous sparse domination and dimensionless weighted estimates for the Bakry Riesz vector

Abstract

We present a fundamentally new proof of the dimensionless Lp boundedness of the Bakry Riesz vector on manifolds with bounded geometry. Our proof has the significant advantage that it allows for a much stronger conclusion than previous arguments, namely that of some new dimensionless weighted estimates with optimal exponent. Part of the importance of this task lies in the novelty of the techniques: we develop the self similarity argument known as sparse domination in the setting of uniformly integrable cadlag Hilbert space valued martingales and extend the domination to a process with infinite memory. We provide a range of optimal weighted estimates and weak type estimates for these stochastic processes. Previous geometric Riesz transform estimates relied on Bellman functions and did not provide this range of weighted estimates. The development of sparse domination in this probabilistic setting and its use for high dimensional problems is new.

Explore related subjects

Keep this discovery

BibTeXRIS

Komla Domelevo, Stefanie Petermichl, Kristina Ana Škreb. 2022-11-19. Continuous sparse domination and dimensionless weighted estimates for the Bakry Riesz vector. https://arxiv.org/abs/2211.10762

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