Search arXivSearch

arXiv · 1412.2452

Random Locations, Ordered Random Sets and Stationarity

Abstract

Intrinsic location functional is a large class of random locations containing locations that one may encounter in many cases, e.g., the location of the path supremum/infimum over a given interval, the first/last hitting time, etc. It has been shown that this notion is very closely related to stationary stochastic processes, and can be used to characterize stationarity. In this paper the author firstly identifies a subclass of intrinsic location functional and proves that this subclass has a deep relationship to stationary increment processes. Then we describe intrinsic location functionals using random partially ordered point sets and piecewise linear functions. It is proved that each random location in this class corresponds to the location of the maximal element in a random set over an interval, according to certain partial order. Moreover, the locations changes in a very specific way when the interval of interest shifts along the real line. Based on these ideas, a generalization of intrinsic location functional called "local intrinsic location functional" is introduced and its relationship with intrinsic location functional is investigated.

Explore related subjects

Keep this discovery

BibTeXRIS

Yi Shen. 2014-12-08. Random Locations, Ordered Random Sets and Stationarity. https://arxiv.org/abs/1412.2452

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