SearcharxivSearch

arXiv · 0907.2295

Spectral Analysis of Multi-dimensional Self-similar Markov Processes

Abstract

In this paper we consider a discrete scale invariant (DSI) process $\{X(t), t\in {\bf R^+}\}$ with scale $l>1$. We consider to have some fix number of observations in every scale, say $T$, and to get our samples at discrete points $\alpha^k, k\in {\bf W}$ where $\alpha$ is obtained by the equality $l=\alpha^T$ and ${\bf W}=\{0, 1,...\}$. So we provide a discrete time scale invariant (DT-SI) process $X(\cdot)$ with parameter space $\{\alpha^k, k\in {\bf W}\}$. We find the spectral representation of the covariance function of such DT-SI process. By providing harmonic like representation of multi-dimensional self-similar processes, spectral density function of them are presented. We assume that the process $\{X(t), t\in {\bf R^+}\}$ is also Markov in the wide sense and provide a discrete time scale invariant Markov (DT-SIM) process with the above scheme of sampling. We present an example of DT-SIM process, simple Brownian motion, by the above sampling scheme and verify our results. Finally we find the spectral density matrix of such DT-SIM process and show that its associated $T$-dimensional self-similar Markov process is fully specified by $\{R_{j}^H(1),R_{j}^H(0),j=0, 1,..., T-1\}$ where $R_j^H(\tau)$ is the covariance function of $j$th and $(j+\tau)$th observations of the process.

Explore related subjects

Keep this discovery

BibTeXRIS

N. Modarresi, S. Rezakhah. 2009-07-14. Spectral Analysis of Multi-dimensional Self-similar Markov Processes. https://doi.org/10.1088/1751-8113/43/12/125004

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