Add to ORKGThe aim of this thesis is to compare two major models of random sets, the well established random closed sets (RACS) and the more recent and more general random measurable sets (RAMS). First, we study the topologies underlying the models, showing they are very different. Thereafter, we introduce RAMS and RACS and reformulate prior findings about their relationship. The main result of this thesis is a characterization of those RAMS that do not induce a corresponding RACS. We conclude by some examples of such RAMS, including a construction of a translation invariant RAMS.
Marginal probability distributions describing statistically random sets in R losed with probability ...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
In this dissertation we investigate two questions in the subject of algorithmic randomness. The firs...
Concepts and results involving random sets appeared in probabilistic and statistical literature long...
In this bachelor thesis we are concerned with basic knowledge in random set theory. We define here s...
Summary. This survey highlights major contributions of George Matheron to developments of random set...
We provide a characterization of the realisable set covariograms, bringing a rig-orous yet abstract ...
35ppInternational audienceWe provide a characterization of the realisable set covariograms, bringing...
One of the main lines of research in the field of algorithmic randomness is that of lowness for rand...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
An analog of ML-randomness in the effective descriptive set theory setting is studied, where the r.e...
The study of random sets is a large and rapidly growing area with connections to many areas of math...
One of the main lines of research in algorithmic randomness is that of lowness notions. Given a rand...
AbstractIn this paper, we investigate refined definition of random sequences. Classical definitions ...
Stochastic geometry is a relatively new branch of mathematics. Although its predecessors such as geo...
Marginal probability distributions describing statistically random sets in R losed with probability ...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
In this dissertation we investigate two questions in the subject of algorithmic randomness. The firs...
Concepts and results involving random sets appeared in probabilistic and statistical literature long...
In this bachelor thesis we are concerned with basic knowledge in random set theory. We define here s...
Summary. This survey highlights major contributions of George Matheron to developments of random set...
We provide a characterization of the realisable set covariograms, bringing a rig-orous yet abstract ...
35ppInternational audienceWe provide a characterization of the realisable set covariograms, bringing...
One of the main lines of research in the field of algorithmic randomness is that of lowness for rand...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
An analog of ML-randomness in the effective descriptive set theory setting is studied, where the r.e...
The study of random sets is a large and rapidly growing area with connections to many areas of math...
One of the main lines of research in algorithmic randomness is that of lowness notions. Given a rand...
AbstractIn this paper, we investigate refined definition of random sequences. Classical definitions ...
Stochastic geometry is a relatively new branch of mathematics. Although its predecessors such as geo...
Marginal probability distributions describing statistically random sets in R losed with probability ...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
In this dissertation we investigate two questions in the subject of algorithmic randomness. The firs...