Number of the records: 1  

Intertwining of birth-and-death processes

  1. 1.
    SYSNO ASEP0357433
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleIntertwining of birth-and-death processes
    Author(s) Swart, Jan M. (UTIA-B) RID, ORCID
    Source TitleKybernetika. - : Ústav teorie informace a automatizace AV ČR, v. v. i. - ISSN 0023-5954
    Roč. 47, č. 1 (2011), s. 1-14
    Number of pages14 s.
    Publication formWWW - WWW
    Languageeng - English
    CountryCZ - Czech Republic
    KeywordsIntertwining of Markov processes ; birth and death process ; averaged Markov process ; first passage time ; coupling ; eigenvalues
    Subject RIVBA - General Mathematics
    R&D ProjectsGA201/09/1931 GA ČR - Czech Science Foundation (CSF)
    CEZAV0Z10750506 - UTIA-B (2005-2011)
    UT WOS000288625300001
    AnnotationIt has been known for a long time that for birth-and-death processes started in zero the first passage time of a given level is distributed as a sum of independent exponentially distributed random variables, the parameters of which are the negatives of the eigenvalues of the stopped process. Recently, Diaconis and Miclo have given a probabilistic proof of this fact by constructing a coupling between a general birth-and-death process and a process whose birth rates are the negatives of the eigenvalues, ordered from high to low, and whose death rates are zero, in such a way that the latter process is always ahead of the former, and both arrive at the same time at the given level. In this note, we extend their methods by constructing a third process, whose birth rates are the negatives of the eigenvalues ordered from low to high and whose death rates are zero, which always lags behind the original process and also arrives at the same time.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2011
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.