Search arXivSearch

arXiv · 1309.0685

A Compensator Characterization of Planar Point Processes

Abstract

Martingale techniques play a fundamental role in the analysis of point processes on the real line. In particular, the compensator of a point process uniquely determines and is determined by its distribution, and an explicit formula involving conditional interarrival distributions is well-known. In two dimensions there are many possible definitions of a point process compensator and we focus here on the one that has been the most useful in practice: the so-called *-compensator. Although existence of the *-compensator is well understood, in general it does not determine the law of the point process and it must be calculated on a case-by-case basis. However, it will be proven that when the point process satisfies a certain property of conditional independence (usually denoted by (F4)), the *- compensator determines the law of the point process and an explicit regenerative formula can be given. The basic building block of the planar model is the single line process (a point process with incomparable jump points). Its law can be characterized by a class of avoidance probabilities that are the two-dimensional counterpart of the survival function in one dimension. Conditional avoidance probabilities then play the same role in the construction of the *-compensator as conditional survival probabilities do for compensators in one dimension.

Explore related subjects

Keep this discovery

BibTeXRIS

B. Gail Ivanoff. 2013-09-03. A Compensator Characterization of Planar Point Processes. https://arxiv.org/abs/1309.0685

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