SearcharxivSearch

arXiv · 1101.3902

On the Order of Magnitude of Sums of Negative Powers of Integrated Processes

Abstract

The asymptotic behavior of expressions of the form $% \sum_{t=1}^{n}f(r_{n}x_{t})$ where $x_{t}$ is an integrated process, $r_{n}$ is a sequence of norming constants, and $f$ is a measurable function has been the subject of a number of articles in recent years. We mention Borodin and Ibragimov (1995), Park and Phillips (1999), de Jong (2004), Jeganathan (2004), P\"{o}tscher (2004), de Jong and Whang (2005), Berkes and Horvath (2006), and Christopeit (2009) which study weak convergence results for such expressions under various conditions on $x_{t}$ and the function $f$. Of course, these results also provide information on the order of magnitude of $% \sum_{t=1}^{n}f(r_{n}x_{t})$. However, to the best of our knowledge no result is available for the case where $f$ is non-integrable with respect to Lebesgue-measure in a neighborhood of a given point, say $x=0$. In this paper we are interested in bounds on the order of magnitude of $% \sum_{t=1}^{n}|x_{t}| ^{-\alpha}$ when $\alpha \geq 1$, a case where the implied function $f$ is not integrable in any neighborhood of zero. More generally, we shall also obtain bounds on the order of magnitude for $\sum_{t=1}^{n}v_{t}|x_{t}| ^{-\alpha}$ where $v_{t}$ are random variables satisfying certain conditions.

Explore related subjects

Keep this discovery

BibTeXRIS

Benedikt M. Pötscher. 2011-01-20. On the Order of Magnitude of Sums of Negative Powers of Integrated Processes. https://arxiv.org/abs/1101.3902

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