Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/23154
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLaha, Arnab Kumar-
dc.contributor.authorYadav, Sumit Kumar-
dc.date.accessioned2020-07-07T06:52:41Z-
dc.date.available2020-07-07T06:52:41Z-
dc.date.issued2019-03-07-
dc.identifier.citationLaha, A. K., & Yadav, S. K. (2019). Forefather distribution in a variant of Galton-Watson branching process. Stochastic Models, 35(3), 269-283. doi:10.1080/15326349. 2019.1578239en_US
dc.identifier.issn1532-4214-
dc.identifier.urihttp://hdl.handle.net/11718/23154-
dc.description.abstractIn this paper, we consider a variant of a discrete time Galton–Watson Branching Process in which an individual is allowed to survive for more than one (but finite) number of generations and may also give birth to offsprings more than once. We model the process using multitype branching process and derive conditions on the mean matrix that determines the long-run behavior of the process. Next, we analyze the distribution of the number of forefathers in a given generation. Here, number of forefathers of an individual is defined as all the individuals since zeroth generation who have contributed to the birth of the individual under consideration. We derive an exact expression for expected number of individuals in a given generation having a specified number of forefathers. Using this exact expression, we provide a detailed analysis for a simple illustrative case. Some interesting insights and possible applications are also discussed.en_US
dc.language.isoen_USen_US
dc.publisherTaylor and Francisen_US
dc.subjectAge structureen_US
dc.subjectAncestorsen_US
dc.subjectCriticalityen_US
dc.subjectDiscrete time multitype branching processesen_US
dc.titleForefather distribution in a variant of Galton–Watson branching processen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.