SearcharxivSearch

arXiv · 1909.09152

On random Fourier-Hermite transform associated with stochastic process

Abstract

Liu and Liu in 2007 introduced the Fourier - Hermite transform $\sum a_{n}\lambda_{n}^{R}\psi_{n}(t)$ which is a random Fourier - Hermite series with random variables $\lambda_{n}^{R}$ choosen randomly from the unit circle of $\mathbb{C}$, where $\psi_{n}(t)$ are Hermite functions and $a_{n}$ are Fourier - Hermite coefficients of an $L^{2}(\mathbb{R})$ function. They used it in image encryption and decryption and expected its application in general signal and image processing. This motivated us to investigate more on random Fourier - Hermite transform by replacing the random variables $\lambda_{n}^{R}$ by some other random variables. It leads to address two problems. First to focus on convergence of random Fourier - Hermite series. Secondly to investigate on finding Fourier transform of the sum function of these random Fourier - Hermite series. The random variables those has been choosen are Fourier - Hermite coefficients of stochastic process. They are independent if associated with Wiener process and dependent if associated with symmetric stable process. The scalars $a_{n}$ are Fourier - Hermite coefficients of functions of suitable $L^{p}$ spaces. The Fourier transform of the sum functions are found out which is possible in case of $p = 2$ only.

Explore related subjects

Keep this discovery

BibTeXRIS

Bharatee Mangaraj, Sabita Sahoo. 2019-09-19. On random Fourier-Hermite transform associated with stochastic process. https://arxiv.org/abs/1909.09152

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