Intertwining of birth-and-death processes

Jan M. Swart

Kybernetika (2011)

  • Volume: 47, Issue: 1, page 1-14
  • ISSN: 0023-5954

Abstract

top
It 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.

How to cite

top

Swart, Jan M.. "Intertwining of birth-and-death processes." Kybernetika 47.1 (2011): 1-14. <http://eudml.org/doc/196582>.

@article{Swart2011,
abstract = {It 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.},
author = {Swart, Jan M.},
journal = {Kybernetika},
keywords = {intertwining of Markov processes; birth and death process; averaged Markov process; first passage time; coupling; eigenvalues; eigenvalues; intertwining of Markov processes; birth and death process; averaged Markov process; first passage time; coupling},
language = {eng},
number = {1},
pages = {1-14},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Intertwining of birth-and-death processes},
url = {http://eudml.org/doc/196582},
volume = {47},
year = {2011},
}

TY - JOUR
AU - Swart, Jan M.
TI - Intertwining of birth-and-death processes
JO - Kybernetika
PY - 2011
PB - Institute of Information Theory and Automation AS CR
VL - 47
IS - 1
SP - 1
EP - 14
AB - It 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.
LA - eng
KW - intertwining of Markov processes; birth and death process; averaged Markov process; first passage time; coupling; eigenvalues; eigenvalues; intertwining of Markov processes; birth and death process; averaged Markov process; first passage time; coupling
UR - http://eudml.org/doc/196582
ER -

References

top
  1. Athreya, S. R., Swart, J. M., 10.1007/s00440-009-0214-x, Probab. Theory Related Fields 147 (2010), 3, 529–563. (2010) Zbl1191.82028MR2639714DOI10.1007/s00440-009-0214-x
  2. Diaconis, P., Miclo, L., 10.1007/s10959-009-0234-6, J. Theor. Probab. 22 (2009), 558–586. (2009) Zbl1186.60086MR2530103DOI10.1007/s10959-009-0234-6
  3. Fill, J. A., 10.1007/BF01046778, I. Theory. J. Theor. Probab. 5 (1992), 1, 45–70. (1992) Zbl0746.60075MR1144727DOI10.1007/BF01046778
  4. HASH(0x2434598), F. R. Gantmacher: The Theory of Matrices, Vol. 2. AMS, Providence 2000. (2000) 
  5. Karlin, S., McGregor, J., 10.2140/pjm.1959.9.1109, Pac. J. Math. 9 (1959), 1109–1140. (1959) Zbl0097.34102MR0114247DOI10.2140/pjm.1959.9.1109
  6. Miclo, L., 10.1051/ps:2008037, ESAIM Probab. Stat. 14 (2010), 117–150. (2010) MR2654550DOI10.1051/ps:2008037
  7. Rogers, L. C. G., Pitman, J. W., Markov functions, Ann. Probab. 9 (1981), 4, 573–582. (1981) Zbl0466.60070MR0624684

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.