SearcharxivSearch

arXiv · 2308.15801

The Time-Dependent Symbol of a Non-Homogeneous It\^o Process and corresponding Maximal Inequalities

Abstract

The probabilistic symbol is defined as the right-hand side derivative at time zero of the characteristic functions corresponding to the one-dimensional marginals of a time-homogeneous stochastic process. As described in various contributions to this topic, the symbol contains crucial information concerning the process. When leaving time-homogeneity behind, a modification of the symbol by inserting a time component is needed. In the present article we show the existence of such a time-dependent symbol for non-homogeneous It\^o processes. Moreover, for this class of processes we derive maximal inequalities which we apply to generalize the Blumenthal-Getoor indices to the non-homogeneous case. These are utilized to derive several properties regarding the paths of the process, including the asymptotic behavior of the sample patsh, the existence of exponential moments and the finiteness of p-variation. In contrast to many situations where non-homogeneous Markov processes are involved, the space-time process cannot be utilized when considering maximal inequalities.

Explore related subjects

Keep this discovery

BibTeXRIS

Sebastian Rickelhoff, Alexander Schnurr. 2023-08-30. The Time-Dependent Symbol of a Non-Homogeneous It\^o Process and corresponding Maximal Inequalities. https://arxiv.org/abs/2308.15801

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