SearcharxivSearch

arXiv · 1511.00224

Linearity of regression for weak records, revisited

Abstract

Since many years characterization of distribution by linearity of regression of non-adjacent weak records E(W_{i+s}|W_i) = β_1 W_i+β_0 for discrete observations has been known to be a difficult question. Lopez- Blazquez (2004) proposed an interesting idea of reducing it to the adjacent case and claimed to have the characterization problem completely solved. We will explain that, unfortunately, there is a major aw in the proof given in that paper. This aw is related to fact that in some situations the operator responsible for reduction of the non-adjacent case to the adjacent one is not injective. The operator is trivially injective when 0<β_1<1. We show that when β_1>=1 the operator is injective when s = 2, 3, 4. Therefore in these cases the method proposed by Lopez-Blazquez is valid. We also show that the operator is not injective when β_1 >=1 and s >= 5. Consequently, in this case the reduction methodology does not work and thus the characterization problem remains open.

Explore related subjects

Keep this discovery

BibTeXRIS

Rafał Karczewski, Jacek Wesołowski. 2016-07-11. Linearity of regression for weak records, revisited. https://arxiv.org/abs/1511.00224

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