2004
DOI: 10.1016/j.spa.2004.01.004
|View full text |Cite
|
Sign up to set email alerts
|

Random clouds and an application to censoring in survival analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(27 citation statements)
references
References 2 publications
0
27
0
Order By: Relevance
“…The proof follows virtually the same sort of arguments as in [3], although the underlying structure is slightly different.…”
Section: Lemma 27 Let Y Be a T -Valued Random Variable And Let ξ Bementioning
confidence: 94%
See 2 more Smart Citations
“…The proof follows virtually the same sort of arguments as in [3], although the underlying structure is slightly different.…”
Section: Lemma 27 Let Y Be a T -Valued Random Variable And Let ξ Bementioning
confidence: 94%
“…(This last equality requires that ξ be a domain: see [3], page 267). Therefore, {C 1/m ∩ ξ = ∅} ∈ F , and the lemma follows.…”
Section: Lemma 27 Let Y Be a T -Valued Random Variable And Let ξ Bementioning
confidence: 99%
See 1 more Smart Citation
“…The framework we will be using is very similar to that used in [6], [8] and [9], except for some details. Let T be a compact complete separable metric space and λ a finite measure on B, the Borel sets of T .…”
Section: The Set-upmentioning
confidence: 99%
“…A simple example is T = [0, 1] d , and we will return to this space in the sequel. Preserving the notation in [9], if D is an arbitrary class of sets, then D(u) will denote the class of finite unions of sets from D. For D an arbitrary subset of T , let T D be a countable dense subset of D. We will use '⊂' to indicate strict inclusion; moreover, D denotes the closure and D • denotes the interior of D. All processes will be indexed by sets belonging to an indexing collection A: Definition 2.1 A nonempty class A of compact, connected subsets of T is called an indexing collection if it satisfies the following:…”
Section: The Set-upmentioning
confidence: 99%