The validity of this approximation and the fact that typical relative
errors are of order \(1/\sqrt{N}\)  have been proved to hold asymptotically
for large \(N\)  by [1]}, for a family
of genealogical algorithms which includes the one adopted here.
