IDEAS home Printed from https://ideas.repec.org/a/hin/jnijsa/673107.html
   My bibliography  Save this article

Tree-indexed processes: a high level crossing analysis

Author

Listed:
  • Mark Kelbert
  • Yuri Suhov

Abstract

Consider a branching diffusion process on R 1 starting at the origin. Take a high level u > 0 and count the number R ( u , n ) of branches reaching u by generation n . Let F k , n ( u ) be the probability P ( R ( u , n ) < k ) , k = 1 , 2 , … . We study the limit lim n → ∞ F k , n ( u ) = F k ( u ) . More precisely, a natural equation for the probabilities F k ( u ) is introduced and the structure of the set of solutions is analysed. We interpret F k ( u ) as a potential ruin probability in the situation of a multiple choice of a decision taken at vertices of a logical tree. It is shown that, unlike the standard risk theory, the above equation has a manifold of solutions. Also an analogue of Lundberg's bound for branching diffusion is derived.

Suggested Citation

  • Mark Kelbert & Yuri Suhov, 2003. "Tree-indexed processes: a high level crossing analysis," International Journal of Stochastic Analysis, Hindawi, vol. 16, pages 1-13, January.
  • Handle: RePEc:hin:jnijsa:673107
    DOI: 10.1155/S1048953303000091
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/IJSA/16/673107.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/IJSA/16/673107.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/S1048953303000091?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnijsa:673107. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.