随机闭集受限选择的界限
Bounds for Restricted Selections of Random Sets
AI总结:
本文研究随机闭集在非原子概率空间上的受限选择集,通过建立均值、中位数和事件概率的精确界,探讨了在期望或中位数约束下选择集的特性,并利用排列和凸对偶论得到极值期望的显式公式。
摘要:
我们研究定义在非原子概率空间上的随机闭集的约束选择集。给定一个随机区间Y=[y_L,y_U]和对可选值的期望或中位数的标量约束,我们表征受限选择集并建立可达到的均值、中位数和事件概率的精确界。特别地,我们给出了在Aumann期望范围内每个值都能作为可测选择的均值的条件,并通过排列和凸对偶论得到在中位数和更高矩限制下的极值期望的显式公式。我们进一步证明,任何随机紧凸集在R^d中的选择集可以由不相交的随机立方体的选择集在L^1意义下近似,每个立方体分解为一维区间选择问题。这为随机紧凸集在R^d中的受限选择问题提供了基于近似的约简方法。
英文摘要:
We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the restricted selection set and establish sharp bounds on the attainable ranges of means, medians, and event probabilities. In particular, we give conditions under which every value in the Aumann expectation range is realized as the mean of a measurable selection, and we obtain explicit formulas for the extremal expectations under median and higher-moment restrictions via rearrangement and convex-duality arguments. We further show that the selection set of any random compact convex set in $\R^d$ can be approximated in $L^1$ by selection sets of disjoint unions of random cubes, each of which decomposes coordinate-wise into one-dimensional interval selection problems. This gives us an approximation-based reduction of constrained selection problems for random compact convex sets in $\R^d$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。