{'fraction_non_alphanumeric': 0.02561576354679803, 'fraction_numerical': 0.0, 'mean_word_length': 5.0476190476190474, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A unified multi-resolution coalescent: Markov lumpings of the Kingman-Tajima n-coalescent

In this paper, we formulate six dierent resolutions of a continuous-time approximation of the Wright-Fisher sample genealogical process. We derive Markov chains for the six dierent approximations in the spirit of J.F.C. Kingman. These Markov chains are essential for inference methods. One of the resolutions is the well-known n-coalescent due to Kingman. The second resolution was mentioned by Tajima, but never explicitly formalized. The other resolutions are novel, and embed the objects of Kingman and Tajima into a general framework via the theory of lumped Markov chains. We show that any sample genealogical Markov chain is amenable to Kingman’s n-coalescent approximation if it has the lineage death chain as its lumped Markov chain. We formulate a lumped n-coalescents graph that embodies multiple n-coalescent resolutions of the underlying sample genealogical process and leads to computationally ecient inference.