Search arXivSearch

arXiv · 1908.11303

Nearly-Linear uncertainty measures

Abstract

Several easy to understand and computationally tractable imprecise probability models, like the Pari-Mutuel model, are derived from a given probability measure P_0. In this paper we investigate a family of such models, called Nearly-Linear (NL). They generalise a number of well-known models, while preserving a simple mathematical structure. In fact, they are linear affine transformations of P_0 as long as the transformation returns a value in [0,1] . We study the properties of NL measures that are (at least) capacities, and show that they can be partitioned into three major subfamilies. We investigate their consistency, which ranges from 2-coherence, the minimal condition satisfied by all, to coherence, and the kind of beliefs they can represent. There is a variety of different situations that NL models can incorporate, from generalisations of the Pari-Mutuel model, the {\epsilon}-contamination model and other models to conflicting attitudes of an agent towards low/high P_0-probability events (both prudential and imprudent at the same time), or to symmetry judgments. The consistency properties vary with the beliefs represented, but not strictly: some conflicting and partly irrational moods may be compatible with coherence. In a final part, we compare NL models with their closest, but only partly overlapping, models, neo-additive capacities and probability intervals.

Explore related subjects

Keep this discovery

BibTeXRIS

Chiara Corsato, Renato Pelessoni, Paolo Vicig. 2019-08-29. Nearly-Linear uncertainty measures. https://doi.org/10.1016/j.ijar.2019.08.001

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