IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v30y1996i2p119-125.html
   My bibliography  Save this article

A note on expected hitting times for birth and death chains

Author

Listed:
  • Palacios, JoséLuis
  • Tetali, Prasad

Abstract

Using the electric network approach, we give closed form formulas for the expected hitting times in (finite and infinite) birth and death chains.

Suggested Citation

  • Palacios, JoséLuis & Tetali, Prasad, 1996. "A note on expected hitting times for birth and death chains," Statistics & Probability Letters, Elsevier, vol. 30(2), pages 119-125, October.
    • Handle: RePEc:eee:stapro:v:30:y:1996:i:2:p:119-125
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0167-7152(95)00209-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bapat, R.B., 2011. "On the first passage time of a simple random walk on a tree," Statistics & Probability Letters, Elsevier, vol. 81(10), pages 1552-1558, October.
    2. Wang, Chengyong & Guo, Ziliang & Li, Shuchao, 2018. "Expected hitting times for random walks on the k-triangle graph and their applications," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 698-710.
    3. Greg Markowsky & José Luis Palacios, 2019. "Symmetry in the Green’s Function for Birth-death Chains," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 841-851, September.
    4. Palacios, José Luis, 2000. "A note on circular Markov chains," Statistics & Probability Letters, Elsevier, vol. 47(3), pages 301-306, April.
    5. José Luis Palacios & Daniel Quiroz, 2016. "Birth and Death Chains on Finite Trees: Computing their Stationary Distribution and Hitting Times," Methodology and Computing in Applied Probability, Springer, vol. 18(2), pages 487-498, June.
    6. Haiyan, Chen & Fuji, Zhang, 2004. "The expected hitting times for graphs with cutpoints," Statistics & Probability Letters, Elsevier, vol. 66(1), pages 9-17, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:30:y:1996:i:2:p:119-125. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.