SearcharxivSearch

arXiv · 1112.0867

Exchangeable Occupancy Models and Discrete Processes with the Generalized Uniform Order Statistics Property

Abstract

This work focuses on Exchangeable Occupancy Models (EOM) and their relations with the Uniform Order Statistics Property (UOSP) for point processes in discrete time. As our main purpose, we show how definitions and results presented in Shaked, Spizzichino and Suter (2004) can be unified and generalized in the frame of occupancy models. We first show some general facts about EOM's. Then we introduce a class of EOM's, called $\mathcal{M}^{(a)}$-models, and a concept of generalized Uniform Order Statistics Property in discrete time. For processes with this property, we prove a general characterization result in terms of $\mathcal{M}^{(a)}$-models. Our interest is also focused on properties of closure w.r.t. some natural transformations of EOM's.

Explore related subjects

Keep this discovery

BibTeXRIS

Francesca Collet, Fabrizio Leisen, Fabio Spizzichino, Florentina Suter. 2013-01-05. Exchangeable Occupancy Models and Discrete Processes with the Generalized Uniform Order Statistics Property. https://arxiv.org/abs/1112.0867

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