On a class of characterization problems for random convex combinations

DOI10.1023/A:1003127114209zbMATH Open0936.60012OpenAlexW2071578271MaRDI QIDQ1293726FDOQ1293726

Rudolf Grübel, Ludwig Baringhaus

Publication date: 9 May 2000

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1003127114209

zbMATH Keywords

contractionsstochastic equationcharacterization problems

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Queueing theory (aspects of probability theory) (60K25)

Cited In (8)

• One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics
• Elementary fixed points of the BRW smoothing transforms with infinite number of summands
• The equivalence of Fourier-based and Wasserstein metrics on imaging problems
• A simple characterization of tightness for convex solid sets of positive random variables
• Title not available (Why is that?)
• Probability Measures with Finite Moments and the Homogeneous Boltzmann Equation
• The Smoothing Transform: A Review of Contraction Results
• Probabilistic characterization of strong convexity

This page was built for publication: On a class of characterization problems for random convex combinations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293726)