Search arXivSearch

arXiv · 1810.03039

Scott functions, their representations on domains, and applications to random sets

Abstract

Choquet theorems (1954) on integral representation for capacities are fundamental to probability theory. They inspired a growing body of research into different approaches and generalizations of Choquet's results by many other researchers. Notably Math\'{e}ron's work (1975) on distributions over the space of closed subsets has led to further advancements in the theory of random sets. This paper was inspired by the work of Norberg (1989) who generalized Choquet's results to distributions over domains. While Choquet's original theorems were obtained for locally compact Hausdorff (LCH) spaces, both Math\'{e}ron's and Norberg's depend on the assumption of separability in their application of the Carath\'{e}odory's method. Our Radon measure approach differs from the work of Math\'{e}ron and Norberg, in that it does not require separability. This investigation naturally leads to the introduction of finite and locally finite valuations, which allows us to characterize finite and locally finite random sets in terms of capacities on the class of compact subsets. Finally, the treatment of L\'{e}vy exponent by Math\'{e}ron and Norberg is revisited, and the notion of exponential valuation is proposed for the representation of general Poisson processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Motoya Machida, Alexander Shibakov. 2018-10-06. Scott functions, their representations on domains, and applications to random sets. https://arxiv.org/abs/1810.03039

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