bibtype |
J -
Journal Article
|
ARLID |
0357433 |
utime |
20240903170622.5 |
mtime |
20110307235959.9 |
WOS |
000288625300001 |
title
(primary) (eng) |
Intertwining of birth-and-death processes |
specification |
page_count |
14 s. |
media_type |
WWW |
|
serial |
ARLID |
cav_un_epca*0297163 |
ISSN |
0023-5954 |
title
|
Kybernetika |
volume_id |
47 |
volume |
1 (2011) |
page_num |
1-14 |
publisher |
name |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
|
keyword |
Intertwining of Markov processes |
keyword |
birth and death process |
keyword |
averaged Markov process |
keyword |
first passage time |
keyword |
coupling |
keyword |
eigenvalues |
author
(primary) |
ARLID |
cav_un_auth*0217893 |
name1 |
Swart |
name2 |
Jan M. |
full_dept (cz) |
Stochastická informatika |
full_dept (eng) |
Department of Stochastic Informatics |
department (cz) |
SI |
department (eng) |
SI |
institution |
UTIA-B |
full_dept |
Department of Stochastic Informatics |
fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
source |
|
cas_special |
project |
project_id |
GA201/09/1931 |
agency |
GA ČR |
ARLID |
cav_un_auth*0254026 |
|
research |
CEZ:AV0Z10750506 |
abstract
(eng) |
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. |
reportyear |
2011 |
RIV |
BA |
mrcbC52 |
4 O 4o 20231122134458.4 |
permalink |
http://hdl.handle.net/11104/0195710 |
mrcbT16-e |
COMPUTERSCIENCECYBERNETICS |
mrcbT16-f |
0.473 |
mrcbT16-g |
0.033 |
mrcbT16-h |
9.5 |
mrcbT16-i |
0.0016 |
mrcbT16-j |
0.277 |
mrcbT16-k |
403 |
mrcbT16-l |
61 |
mrcbT16-q |
21 |
mrcbT16-s |
0.307 |
mrcbT16-y |
20.45 |
mrcbT16-x |
0.61 |
mrcbT16-4 |
Q2 |
mrcbT16-B |
23.915 |
mrcbT16-C |
17.500 |
mrcbT16-D |
Q4 |
mrcbT16-E |
Q3 |
arlyear |
2011 |
mrcbTft |
\nSoubory v repozitáři: 0357433.pdf |
mrcbU34 |
000288625300001 WOS |
mrcbU56 |
205.8 KB |
mrcbU63 |
cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 47 č. 1 2011 1 14 Ústav teorie informace a automatizace AV ČR, v. v. i. |
|