SearcharxivSearch

arXiv · 1912.05214

A full scale Sklar's theorem in the imprecise setting

Abstract

In this paper we present a surprisingly general extension of the main result of a paper that appeared in this journal: I. Montes et al., Sklar's theorem in an imprecise setting, Fuzzy Sets and Systems, 278 (2015), 48--66. The main tools we develop in order to do so are: (1) a theory on quasi-distributions based on an idea presented in a paper by R. Nelsen with collaborators; (2) starting from what is called (bivariate) $p$-box in the above mentioned paper we propose some new techniques based on what we call restricted (bivariate) $p$-box; and (3) a substantial extension of a theory on coherent imprecise copulas developed by M. Omladi\v{c} and N. Stopar in a previous paper in order to handle coherence of restricted (bivariate) $p$-boxes. A side result of ours of possibly even greater importance is the following: Every bivariate distribution whether obtained on a usual $\sigma$-additive probability space or on an additive space can be obtained as a copula of its margins meaning that its possible extraordinariness depends solely on its margins. This might indicate that copulas are a stronger probability concept than probability itself.

Explore related subjects

Keep this discovery

BibTeXRIS

Matjaž Omladič, Nik Stopar. 2019-12-11. A full scale Sklar's theorem in the imprecise setting. https://doi.org/10.1016/j.fss.2020.02.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