On ordered stopping times of a Markov process (Q2641010): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q402408
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Patrick J. Fitzsimmons / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1214/aop/1176990636 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055317130 / rank
 
Normal rank

Latest revision as of 01:08, 20 March 2024

scientific article
Language Label Description Also known as
English
On ordered stopping times of a Markov process
scientific article

    Statements

    On ordered stopping times of a Markov process (English)
    0 references
    1990
    0 references
    Let X be a transient strong Markov process with potential kernel U. It is well-known that if \(\nu\) \(U\leq \mu U\), then there exists a stopping time T such that \(\nu (\cdot)=P^{\mu}(X_ T\in \cdot)\). The author extends this result to the case of infinite sequences and shows that if \(\nu_ 1U\leq \nu_ 2U\leq...\leq \mu U\), then there exists a decreasing sequence of randomized stopping times \(T_ n\) such that \(\nu_ n\) is the law of \(X_{T_ n}\) under the initial distribution \(\mu\). For the proof, he uses the Baxter-Chacon compactness theorem for randomized stopping times. The problem considered in this paper has also been solved by \textit{C. T. Shih} [Ann. Probab. 18, No.4, 1623-1634 (1990)] by a different method.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    strong Markov process
    0 references
    stopping time
    0 references
    randomized stopping times
    0 references
    Baxter- Chacon compactness theorem
    0 references
    0 references