Results 1  10
of
1,087
Kingman’s coalescent and Brownian motion
 Alea
, 2009
"... We describe a simple construction of Kingman’s coalescent in terms of a Brownian excursion. This construction is closely related to, and sheds some new light on, earlier work by Aldous [3] and Warren [23]. Our approach also yields some new results: for instance, we obtain the full multifractal spect ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We describe a simple construction of Kingman’s coalescent in terms of a Brownian excursion. This construction is closely related to, and sheds some new light on, earlier work by Aldous [3] and Warren [23]. Our approach also yields some new results: for instance, we obtain the full multifractal
The external lengths in Kingman’s coalescent
, 2011
"... In this paper we prove asymptotic normality of the total length of external branches in Kingman’s coalescent. The proof uses an embedded Markov chain, which can be described as follows: Take an urnwith n black balls. Empty it in n steps according to the rule: In each step remove a randomly chosen pa ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper we prove asymptotic normality of the total length of external branches in Kingman’s coalescent. The proof uses an embedded Markov chain, which can be described as follows: Take an urnwith n black balls. Empty it in n steps according to the rule: In each step remove a randomly chosen
Some large deviations in Kingman’s coalescent
, 2014
"... Kingman’s coalescent is a random tree that arises from classical population genetic models such as the Moran model. The individuals alive in these models correspond to the leaves in the tree and the following two laws of large numbers concerning the structure of the treetop are wellknown: (i) T ..."
Abstract
 Add to MetaCart
Kingman’s coalescent is a random tree that arises from classical population genetic models such as the Moran model. The individuals alive in these models correspond to the leaves in the tree and the following two laws of large numbers concerning the structure of the treetop are wellknown: (i
Computational inference beyond Kingman’s coalescent
, 2014
"... Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or othe ..."
Abstract
 Add to MetaCart
Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable the material made available in WRAP has been checked for eligibility before being made available. Copies of full items can be used for personal research or study, educational, or notfor profit purposes without prior permission or charge. Provided that the authors, title and full bibliographic details are credited, a hyperlink and/or URL is given for the original metadata page and the content is not changed in any way. A note on versions: The version presented here may differ from the published version or, version of record, if you wish to cite this item you are advised to consult the publisher’s version. Please see the ‘permanent WRAP url ’ above for details on accessing the published version and note that access may require a subscription.
THE COALESCENT EFFECTIVE SIZE OF AGESTRUCTURED POPULATIONS 1
, 2005
"... We establish convergence to the Kingman coalescent for a class of agestructured population models with timeconstant population size. Time is discrete with unit called a year. Offspring numbers in a year may depend on mother’s age. 1. Introduction. The ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We establish convergence to the Kingman coalescent for a class of agestructured population models with timeconstant population size. Time is discrete with unit called a year. Offspring numbers in a year may depend on mother’s age. 1. Introduction. The
© Institute of Mathematical Statistics, 2005 THE COALESCENT EFFECTIVE SIZE OF
"... We establish convergence to the Kingman coalescent for a class of agestructured population models with timeconstant population size. Time is discrete with unit called a year. Offspring numbers in a year may depend on mother’s age. 1. Introduction. The ..."
Abstract
 Add to MetaCart
We establish convergence to the Kingman coalescent for a class of agestructured population models with timeconstant population size. Time is discrete with unit called a year. Offspring numbers in a year may depend on mother’s age. 1. Introduction. The
Diffusion processes and coalescent trees
"... In modern mathematical population genetics the ancestral history of a population of genes back in time is described by John Kingman’s coalescent tree. Classical and modern approaches model gene frequencies by diffusion processes. This paper, which is partly a review, discusses how coalescent process ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In modern mathematical population genetics the ancestral history of a population of genes back in time is described by John Kingman’s coalescent tree. Classical and modern approaches model gene frequencies by diffusion processes. This paper, which is partly a review, discusses how coalescent
ELECTRONIC COMMUNICATIONS in PROBABILITY Some large deviations in Kingman’s coalescent*
"... Kingman’s coalescent is a random tree that arises from classical population genetic models such as the Moran model. Concerning the structure of the treetop there are two wellknown laws of large numbers: (i) The (shortest) distance, denoted by Tn, from the treetop to the level when there are n lin ..."
Abstract
 Add to MetaCart
Kingman’s coalescent is a random tree that arises from classical population genetic models such as the Moran model. Concerning the structure of the treetop there are two wellknown laws of large numbers: (i) The (shortest) distance, denoted by Tn, from the treetop to the level when there are n
Results 1  10
of
1,087