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

Chainability of infinitely divisible measures

Author

Listed:
  • Bar-Lev, Shaul K.
  • Letac, Gérard

Abstract

Let ρ0 be a positive measure on R with Laplace transform Lρ0(θ) defined on a set whose interior Θ(ρ0) is nonempty and let kρ0=logLρ0 be its cumulant transform. Then ρ0 is infinitely divisible iff kρ0′′ is a Laplace transform of some positive measure ρ1. If also ρ1 is infinitely divisible, then kρ1′′ is a Laplace transform of some positive measure ρ2 and so forth, until we reach a k such that ρk is not infinitely divisible. If such a k does not exist, we say that ρ0 is infinitely chainable. We say that ρ0 is infinitely chainable of order k0 if it is infinitely chainable and k0 is the smallest k for which ρk=ρk+1. In this note, we prove that ρ0 is infinitely chainable order k0 iff ρk0 falls into one of three classes: the gamma, hyperbolic, or negative binomial classes, a somewhat surprising result.

Suggested Citation

  • Bar-Lev, Shaul K. & Letac, Gérard, 2025. "Chainability of infinitely divisible measures," Statistics & Probability Letters, Elsevier, vol. 216(C).
    • Handle: RePEc:eee:stapro:v:216:y:2025:i:c:s0167715224002256
    DOI: 10.1016/j.spl.2024.110256
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715224002256
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2024.110256?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
    ---><---

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

    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:216:y:2025:i:c:s0167715224002256. 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.