SearcharxivSearch

arXiv · 1803.09940

Weakly Consistent Extensions of Lower Previsions

Abstract

Several consistency notions are available for a lower prevision P assessed on a set D of gambles (bounded random variables), ranging from the well known coherence to convexity and to the recently introduced 2-coherence and 2-convexity. In all these instances, a procedure with remarkable features, called (coherent, convex, 2-coherent or 2-convex) natural extension, is available to extend P, preserving its consistency properties, to an arbitrary superset of gambles. We analyse the 2-coherent and 2-convex natural extensions, E_2 and E_2c respectively, showing that they may coincide with the other extensions in certain, special but rather common, cases of `full' conditional lower prevision or probability assessments. This does generally not happen if P is a(n unconditional) lower probability on the powerset of a given partition and is extended to the gambles defined on the same partition. In this framework we determine alternative formulae for E_2 and E_2c. We also show that E_2c may be nearly vacuous in some sense, while the Choquet integral extension is 2-coherent if P is, and bounds from above the 2-coherent natural extension. Relationships between the finiteness of the various natural extensions and conditions of avoiding sure loss or weaker are also pointed out.

Explore related subjects

Keep this discovery

BibTeXRIS

Renato Pelessoni, Paolo Vicig. 2018-03-27. Weakly Consistent Extensions of Lower Previsions. https://doi.org/10.1016/j.fss.2017.07.021

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