IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0328707.html
   My bibliography  Save this article

Optimal experimental design for partially observable pure birth processes

Author

Listed:
  • Ali Eshragh
  • Matthew P Skerritt
  • Bruno Salvy
  • Thomas McCallum

Abstract

We develop an efficient algorithm to find optimal observation times by maximizing the Fisher information for the birth rate of a partially observable pure birth process involving n observations. Partially observable implies that at each of the observation time points for counting the number of individuals present in the pure birth process, each individual is observed independently with a fixed probability p, modeling detection difficulties or constraints on resources. We apply concepts and techniques from generating functions, using a combination of symbolic and numeric computation, to establish a recursion for evaluating and optimizing the Fisher information. The recursion, while still computationally intensive, greatly improves on previously known computational methods which quickly became intractable even in the n = 2 case. Our numerical results reveal the efficacy of this new method. An implementation of the algorithm is available publicly.

Suggested Citation

  • Ali Eshragh & Matthew P Skerritt & Bruno Salvy & Thomas McCallum, 2025. "Optimal experimental design for partially observable pure birth processes," PLOS ONE, Public Library of Science, vol. 20(8), pages 1-33, August.
  • Handle: RePEc:plo:pone00:0328707
    DOI: 10.1371/journal.pone.0328707
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0328707
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0328707&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0328707?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:plo:pone00:0328707. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.