Random compact set meets the graph of nonrandom continuous function

2013/08/23 by Boris Tsirelson, Tsirelson, Boris
Mathematics · #Advanced Banach Space Theory #Advanced Operator Algebra Research #FOS: Mathematics #Mathematical Analysis and Transform Methods #Probability (math.PR)

paper · pdf · doi:10.48550/arxiv.1308.5112

openalex publication_date 2013/08/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

On the plane, every random compact set with almost surely uncountable first projection intersects with a high probability the graph of some continuous function. Implication: every black noise over the plane fails to factorize when the plane is split by such graph.

Related

• Closed Graph Theorem For Linear Random Operators
• On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
• Threshold phenomena for random discrete structures
• Geometric random graphs and Rado sets of continuous functions
• Thresholds and expectation thresholds