Random compact set meets the graph of nonrandom continuous function
classification
🧮 math.PR
keywords
graphplanecompactcontinuouseveryfunctionrandomalmost
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.