IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v70y2014icp19-34.html
   My bibliography  Save this article

An EM algorithm for the model fitting of Markovian binary trees

Author

Listed:
  • Hautphenne, Sophie
  • Fackrell, Mark

Abstract

Markovian binary trees form a class of continuous-time branching processes where the lifetime and reproduction epochs of individuals are controlled by an underlying Markov process. An Expectation–Maximization (EM) algorithm is developed to estimate the parameters of the Markov process from the continuous observation of some populations, first with information about which individuals reproduce or die (the distinguishable case), and second without this information (the indistinguishable case). The performance of the EM algorithm is illustrated with some numerical examples. Fits resulting from the distinguishable case are shown not to be significantly better than fits resulting from the indistinguishable case using some goodness of fit measures.

Suggested Citation

  • Hautphenne, Sophie & Fackrell, Mark, 2014. "An EM algorithm for the model fitting of Markovian binary trees," Computational Statistics & Data Analysis, Elsevier, vol. 70(C), pages 19-34.
    • Handle: RePEc:eee:csdana:v:70:y:2014:i:c:p:19-34
    DOI: 10.1016/j.csda.2013.08.015
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Lothar Breuer, 2002. "An EM Algorithm for Batch Markovian Arrival Processes and its Comparison to a Simpler Estimation Procedure," Annals of Operations Research, Springer, vol. 112(1), pages 123-138, April.
    2. Veen, Alejandro & Schoenberg, Frederic P., 2008. "Estimation of SpaceTime Branching Process Models in Seismology Using an EMType Algorithm," Journal of the American Statistical Association, American Statistical Association, vol. 103, pages 614-624, June.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. González, M. & Minuesa, C. & del Puerto, I., 2016. "Maximum likelihood estimation and expectation–maximization algorithm for controlled branching processes," Computational Statistics & Data Analysis, Elsevier, vol. 93(C), pages 209-227.
    2. Hautphenne, Sophie & Massaro, Melanie & Turner, Katharine, 2019. "Fitting Markovian binary trees using global and individual demographic data," Theoretical Population Biology, Elsevier, vol. 128(C), pages 39-50.
    3. Nina Daskalova, 2017. "Expectation maximization estimates of the offspring probabilities in a class of multitype branching processes with binary family trees," Mathematical Population Studies, Taylor & Francis Journals, vol. 24(4), pages 246-256, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mohler, George, 2014. "Marked point process hotspot maps for homicide and gun crime prediction in Chicago," International Journal of Forecasting, Elsevier, vol. 30(3), pages 491-497.
    2. Chiang, Wen-Hao & Liu, Xueying & Mohler, George, 2022. "Hawkes process modeling of COVID-19 with mobility leading indicators and spatial covariates," International Journal of Forecasting, Elsevier, vol. 38(2), pages 505-520.
    3. Peter Halpin & Paul Boeck, 2013. "Modelling Dyadic Interaction with Hawkes Processes," Psychometrika, Springer;The Psychometric Society, vol. 78(4), pages 793-814, October.
    4. Chenlong Li & Zhanjie Song & Wenjun Wang, 2020. "Space–time inhomogeneous background intensity estimators for semi-parametric space–time self-exciting point process models," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 72(4), pages 945-967, August.
    5. Yera, Yoel G. & Lillo, Rosa E. & Ramírez-Cobo, Pepa, 2019. "Fitting procedure for the two-state Batch Markov modulated Poisson process," European Journal of Operational Research, Elsevier, vol. 279(1), pages 79-92.
    6. Julio A. Crego, 2017. "Short Selling Ban and Intraday Dynamics," Working Papers wp2018_1715, CEMFI.
    7. Eric W. Fox & Martin B. Short & Frederic P. Schoenberg & Kathryn D. Coronges & Andrea L. Bertozzi, 2016. "Modeling E-mail Networks and Inferring Leadership Using Self-Exciting Point Processes," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 111(514), pages 564-584, April.
    8. Wheatley, Spencer & Filimonov, Vladimir & Sornette, Didier, 2016. "The Hawkes process with renewal immigration & its estimation with an EM algorithm," Computational Statistics & Data Analysis, Elsevier, vol. 94(C), pages 120-135.
    9. Dimitri frosinin & L. Breuer, 2006. "Threshold policies for controlled retrial queues with heterogeneous servers," Annals of Operations Research, Springer, vol. 141(1), pages 139-162, January.
    10. Giada Adelfio & Arianna Agosto & Marcello Chiodi & Paolo Giudici, 2021. "Financial contagion through space-time point processes," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 30(2), pages 665-688, June.
    11. Angelos Dassios & Hongbiao Zhao, 2017. "A Generalized Contagion Process With An Application To Credit Risk," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 20(01), pages 1-33, February.
    12. Andrzej Chydzinski & Pawel Mrozowski, 2016. "Queues with Dropping Functions and General Arrival Processes," PLOS ONE, Public Library of Science, vol. 11(3), pages 1-23, March.
    13. Lin, Lei & Wang, Qian & Sadek, Adel W., 2014. "Border crossing delay prediction using transient multi-server queueing models," Transportation Research Part A: Policy and Practice, Elsevier, vol. 64(C), pages 65-91.
    14. V. Filimonov & D. Sornette, 2015. "Apparent criticality and calibration issues in the Hawkes self-excited point process model: application to high-frequency financial data," Quantitative Finance, Taylor & Francis Journals, vol. 15(8), pages 1293-1314, August.
    15. B. Houdt & J. Velthoven & C. Blondia, 2008. "QBD Markov chains on binomial-like trees and its application to multilevel feedback queues," Annals of Operations Research, Springer, vol. 160(1), pages 3-18, April.
    16. González, M. & Minuesa, C. & del Puerto, I., 2016. "Maximum likelihood estimation and expectation–maximization algorithm for controlled branching processes," Computational Statistics & Data Analysis, Elsevier, vol. 93(C), pages 209-227.
    17. Vipul Aggarwal & Elina H. Hwang & Yong Tan, 2021. "Learning to Be Creative: A Mutually Exciting Spatiotemporal Point Process Model for Idea Generation in Open Innovation," Information Systems Research, INFORMS, vol. 32(4), pages 1214-1235, December.
    18. Dassios, Angelos & Zhao, Hongbiao, 2017. "A generalised contagion process with an application to credit risk," LSE Research Online Documents on Economics 68558, London School of Economics and Political Science, LSE Library.
    19. Gresnigt, Francine & Kole, Erik & Franses, Philip Hans, 2015. "Interpreting financial market crashes as earthquakes: A new Early Warning System for medium term crashes," Journal of Banking & Finance, Elsevier, vol. 56(C), pages 123-139.
    20. Casale, Giuliano & Sansottera, Andrea & Cremonesi, Paolo, 2016. "Compact Markov-modulated models for multiclass trace fitting," European Journal of Operational Research, Elsevier, vol. 255(3), pages 822-833.

    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:csdana:v:70:y:2014:i:c:p:19-34. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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/locate/csda .

    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.