Search arXivSearch

arXiv · 2504.13620

Set-valued conditional functionals of random sets

Abstract

Many key quantities in statistics and probability theory such as the expectation, quantiles, expectiles and many risk measures are law-determined maps from a space of random variables to the reals. We call such a law-determined map, which is normalised, positively homogeneous, monotone and translation equivariant, a gauge function. Considered as a functional on the space of distributions, we can apply such a gauge to the conditional distribution of a random variable. This results in conditional gauges, such as conditional quantiles or conditional expectations. In this paper, we apply such scalar gauges to the support function of a random closed convex set $\bX$. This leads to a set-valued extension of a gauge function. We also introduce a conditional variant whose values are themselves random closed convex sets. In special cases, this functional becomes the conditional set-valued quantile or the conditional set-valued expectation of a random set. In particular, in the unconditional setup, if $\bX$ is a random translation of a deterministic cone and the gauge is either a quantile or an expectile, we recover the cone distribution functions studied by Andreas Hamel and his co-authors. In the conditional setup, the conditional quantile of a random singleton yields the conditional version of the half-space depth-trimmed regions.

Explore related subjects

Keep this discovery

BibTeXRIS

Tobias Fissler, Ilya Molchanov. 2025-04-18. Set-valued conditional functionals of random sets. https://doi.org/10.1007/s00186-026-00923-9

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