A representation for the semigroup of a two-level Fleming Viot process in terms of the Kingman nested coalescent
|
|
- Verity Fields
- 5 years ago
- Views:
Transcription
1 A representation for the semigroup of a two-level Fleming Viot process in terms of the Kingman nested coalescent Airam Blancas June 11, 017 Abstract Simple nested coalescent were introduced in [1] to model backwards in time the genealogy of both, species trees and genes trees. In this setting the Kingman case corresponds to binary coalescences in the species tree or binary coalescences in the genes tree. On the other hand, two level Fleming Viot with two level selection arises in [] as the limit in distribution of multilevel multitype population undergoing mutation, selection, genetic drift and spatial migration. In this note, we establish a duality relation between Kingman nested coalescents and the two level Fleming Viot associated with a two-level multitype population with genetic drift. Using this relation we can read off the genealogy backwards in time of a Kingman nested. Keywords. process. Nested coalescent process, two-level Fleming Viot process, function valued dual 1 Introduction models 1.1 The nested coalescent In phylogenetics, gene trees provide a diagrammatical representation of evolutionary relationships. In this case the branching points are generated because a gene in the sample replicates, and its copies are passed on to more than one offspring. In a corresponding evolution model, one can think of the genes as the individuals of an haploid population which reproduces in generations. On the other hand, species trees represent the genealogy of species, i.e. of populations of individuals that are capable of interbreeding. Since these individuals have their own genetic information, gene trees can be viewed as being embedded in the species phylogeny. Therefore gene lineages are allowed to coalesce while they are in the same branch of the species tree. In other words, if two genes i and j have not coalesced by time t (backwards) they are not yet in ancestral relation. In addition, if these genes are associated to different species at time t, then they are not yet in relation by species. Using this heuristic, a nested partition is formally defined in [1]. Moreover with the aim to provide a probabilistic model to describe the dynamic of genes and species trees, in this work a family of Markov processes with values in the space of nested bivariate partitions of N, called simple nested exchangeable coalescent, for short snec, is properly defined. A typical element in the state space of nested coalescents is denoted by Institut für Mathematik, Goethe Universität Frankfurt am Main. Germany. blancas@math.uni-frankfurt.de Box 11193, Frankfurt am Main, 1
2 π = (π s, π g ). We agree that blocks associated with, the species and the genes partitions are enumerated in increasing order of their least element. Proposition 1 of [1] established that there exists a partition π, called link partition, which allow us to write the species partition in terms of the labels of the genes partition through the coagulation operator, that is, π s = Coag(π g, π). Namely the elements in the i-th block of the link partition correspond to the labels of the genes blocks nested to the i-th species, i.e. if j π i then the block π g j is nested to πs i. Example 1. An example of nested partition of [10] is π = (π s, π g ) where π s = ({1, 3, 5}, {, 6, 8, 9}, {4, 7, 10}) π g = ({1}, {}, {3, 5}, {4, 7}, {6, 9}, {8}, {10}) The corresponding link partition is π = ({1, 3}, {, 5, 6}, {4, 7}). According to [1] the snec transitions are characterized by a measure Σ on [0, 1] M 1 ([0, 1]). The case Σ = δ 0 δ δ0 is the called nested Kingman coalescent (K t : t 0). In this process a pair of species merges or a pair of genes merges inside one species. More precisely, two types of transitions are possible: At rate γ 1, two blocks of the gene partition nested in the same species merge into a single block. At rate γ transition that involves picking two integers i < j occurs, that is, for all species blocks labeled j, changing the label from j to i. We point out that the Kingman nested coalescent describes the genealogy of a two-level coalecent (see subsection in [] for a general description) with state space the marked partition ((ρ, ζ(ρ)) : ρ P, ζ(ρ) N ρ ), (P denotes the set of partitions of N) and such that the blocks in the partition ρ jumps to a new unoccupied site with rate zero. In a two-level coalescent the marks represent positions in N of the blocks of ρ, we can view the partition ρ as the genes partition π g and the marks as the labels of the species block in which genes blocks are nested. Moreover {ζ(i) : i = 1,..., ρ } {η(π g i ) : i = 1,..., πg }, ζ = {k N : ζ(i) = k for some i {1,..., ρ }} π s = π, n i (ρ) π i, where η is the nest function introduced in [1], that is, η(π g i ) = j implies πg i πj s; n i(ρ) denotes the number of subsets with ζ = i. The transitions in a two level coalescent occurs in every single level: At level I two blocks of the partitions ρ merge at rate γ 1 if they are at the same site. Besides all the partitions at two sites combine to form a single site with all these subsets at rate γ. Therefore given ( ζ(ρ), (n 1,..., n ζ(ρ) )) = (m, (n 1,..., n m )) the possible transitions are: (m, (n 1,..., n m )) (m, (n 1,..., n i 1,..., n m )), at rate γ 1 n i n i 1, (m, (n 1,..., n m )) (m 1, (n 1,..., n i 1, n i + n j, n i+1,..., n j 1, n j+1,..., n m )), at rate γ m m 1, This transitions correspond with the transitions of a sample with m species and n i genes in everyone species, i.e. ( π s, ( π 1,..., π π s ) ) = (m, (n 1,..., n m )).
3 Genes trees and species trees can be viewed as a hierarchy of two levels: individuals and colonies. Recently, a class of multilevel measure-valued processes which model ensembles of subpopulations with mutation and selection at the subpopulation level, and possible death and replacement of subpopulations has been studied by []. The main goal in this work is to provide a representation for the semigroup of a two-level Fleming Viot process in terms of the Kingman coalescent. In the following subsection we introduce the model described in []. 1. The two-level Fleming Viot Dawson [] analyzes a class of measure-valued processes which model multilevel multitype population undergoing mutation, selection, genetic drift and spatial migration. In this manuscript we will only focus on a two-level population with random genetic drift, via resampling, at both levels. To be precise, we consider a finite multi-type population allocated in M colonies with fixed size N. The set of types is I = {1,..., K} space and N i denotes the number of type i individual in everyone colony. Hence we can write the size of a typical family, N = and the type distribution in everyone colony K N i. Z := 1 N K N i δ i, which is an element on, the space of probability measures on {1,..., K}. Let us now give the description of the genetic drift. Individuals level: at rate γ 1 an individual of type i is chosen with probability x i and replaced by a type j individual which has been chosen with probability x j from the remainder N 1 individuals. Colonies level: at rate γ the i-th colony is chosen according to its type distribution µ i (t) = 1 K K n i,j (t) N δ j, where n ij (t) denotes the number of type j in the i-th colony at time t; and replaced by one of the remainder M 1. Therefore, the dynamic of the individuals in each colony is given by a continuous time Markov chain (V(t) : t 0) taking values on, with transitions probabilities ν ν 1 N δ i + 1 N δ j, at rate (N 1) γ 1 x ix j, for i, j I. Upon the colonies dynamic is described by the continuous time () M -valued Markov chain µ(t) = (µ 1 (t),..., µ M (t) : t 0). It will be convenient to think µ(t) as the following empirical measure Ξ N,M t = 1 M M δ µi (t) P(). (1) 3
4 Then its corresponding transitions probabilities are given by ξ (ξ + 1 M ( δ µ i + δ µj )) at rate γ (M 1)ξ(dµ i)ξ(dµ j ), () ξ ξ + 1 M (δ µ δ i N + δ j N δ µ ) at rate (N 1) γ 1 x ix j ξ(dµ). (3) In [], the asymptotic behavior of the process (Ξ N,M t : t 0) is investigated in three different stages. Firstly for a single colony when its size N. This leads as limit a -valued process called K-type Fleming-Viot, which is the unique solution of a well posed martingale problem, see Proposition.1 of [] for the description of the generator. In the next stage, a càdlàg strong Markov process with state space () N arises as the limit of a population with a finite number of colonies with size N. Finally taking both N and the number of colonies M, the author showed that there exists a process (Ξ t : t 0) with values in the space of function on P() which is the the unique solution {P ξ : ξ P()}, to the martingale problem: AH(ξ) = A 1 δh(ξ) δξ(µ) + γ δ H(ξ) δ(ξ(µ 1 ))δ(ξ(µ )) (ξ(dµ 1)δ µ1 (dµ ) ξ(dµ 1 )ξ(µ )), where A 1 denotes the generator of a K-type Fleming Viot process and m H(ξ) = h j (x 1,..., x nj )dµ n j j ξ(µ j ), (4) j=1 I n j with m the number of colonies in the sample and n i is number of individuals sampled in the i-th colony. The process Ξ is the two level Fleming Viot process. The reader is referred to Theorem 1 of [] for the definition of the two level Fleming Viot with two selection. An important tool in our analysis is duality. Namely, we will need the dual process (G t : t 0) of the two level Fleming Viot. According to [] it takes values in G, the algebra containing functions of the form G f (ξ) = m j=1 n j k=1 I f jk (x k )µ j (dx k )ξ(dµ j ), (5) where f := (f 1,..., f m ) with f j (x 1,..., x nj ) = (f j1 (x 1 ),..., f 1nj (x nj )) and f iji : I R. The dynamics of its generator includes a jump with rate γ 1 to the state G f j (ξ) where kl We take Therefore, f j kl = (f 1,..., f j 1,,..., f j kl, f j+1,..., f l 1, f l+1,..., f m ). (6) f j kl ( x1,..., x nj ) = (f j1 (x 1 ),..., f j,k 1 (x k 1 ), f jk (x k )f jl (x k ), f j,k+1 (x k+1 ),..., G f j (ξ) = kl f jk (x k )f jl (x k )µ j (dx k ) u [m]\{j} f j,l 1 (x l 1 ), f j,l+1 (x l+1 ),..., f jnj (x nj )). (7) v [n j ]\{k,l} nu f uv (x v )µ u (dx v )ξ(dµ u ), v=1 I f jv (x v )µ j (dx v ) ξ(dµ j ) 4
5 Similarly at rate γ the process (G t : t 0) jumps to the state G f ij(ξ) where f ij = (f 1,..., f i 1,,..., f ij, f i+1,..., f j 1, f j+1,..., f m ), (8) with f ij (x 1,..., x nj ) = (f i1 (x 1 ),..., f ini (x ni ), f j1 (x 1 ),..., f jnj (x nj )). (9) Hence G f ij(ξ) is written as follows, G f ij(ξ) = ( n i u=1 u [m]\{i,j} f iu (x u )µ i (dx u ) v=1 I n j u=1 f ju (x u )µ i (dx u ) nu f uv (x v )µ u (dx v )ξ(dµ u ), ) ξ(dµ i ) For sake of completeness we now write the generator of the dual process (G t : t 0). AG f (ξ) = γ n m j 1 G f j (ξ) G f (ξ) + γ m m G kl f ij(ξ) G f (ξ). j=1 k=1 l [n j ]\{j} j [m]\{i} Remark 1. The transitions of the dual process (G t : t 0) correspond to the transitions of the nested Kingman colaescent (K t : t 0). Indeed, we can associate with the arguments of f j (x 1,..., x nj ) the j-th species block and with the arguments of f ij (x j ) the j-th block of the gene block of species i. Hence the transition to (6) corresponds to the coalescence of genes k and l in the species j. Similarly the transition to (8) describes the lumping of species i and j. The duality relation between the two level Fleming Viot (Ξ t : t 0) and the function valued process (G t : t 0) is formally established in Theorem 3 of [], through the function H : P() G [0, 1] defined by H(G f, ξ) = m n j j=1 k=1 f kj (x k )µ j (dx k )ξ(dµ j ). where G f is the function defined in (5). Namely the following duality relation holds Main result E Ξ0 (H(G 0, Ξ t )) = E G0 (H(G t, Ξ 0 )). (10) In this section we will use the duality relation (10) to establish that the two level Fleming Viot process (Ξ t : t 0) can be conceived as the forward in time model for the Kingman nested coalescent (K t : t 0). Namely we will define a function h which is basically the function h with coordinates structured by a nested partition which correspond to the state space of the Kingman nested coalescent. For fixed t > 0, assume that K t = π N n, the set of nested partitions of [n]. Let π be the link partition associated with π and (s, g) := ( π s, π g ). We propose to associate the i-th coordinate 5
6 of the function h with the element in the position i of the partition π. In this direction we define h : I g R + as follows: h π (y 11,..., y 1 π1,..., y s1,..., y s πs ) := h(x π 1,..., x π n), for i = 1,..., g; j = 1,..., s and k j = 1,..., π j, where x π i := y j(i)κ(i), i [n]. Here j(i) denotes the index of the partition element σ(i) of π s to which i belongs and κ(i) denotes the index of the partition element of π g within σ(i) to which i belongs. Example. For the partition π in Example 1, observe that x π 1 = y 11, x π 3 = y 1, x π 8 = y 3, x π 10 = y 3. Continuing with this procedure we obtain, h π (y 11, y 1, y 1, y, y 3, y 31, y 3 ) = h(y 11, y 1, y 1, y 31, y 1, y, y 31, y 3, y, y 3 ). We now observe that the equalities (4) and (5), and therefore G f (ξ) and h are related through the identity h j (x 1,..., x nj ) = n j k=1 f jk(x k ). Putting the pieces together H(h π, ξ) = h π (y 11,..., y 1 π1,..., y s1,..., y s πs ) s π k l=1 j=1 (µ j (dy jk )ξ(dµ j )). (11) Example 3. Continuing with the Example, H(h π, ξ) = h π (y 11, y 1, y 1, y, y 3, y 31, y 3 )µ 1 (dy 11 )µ 1 (dy 1 ) We are now able to establish our main result. µ (dy 1 )µ (dy )µ (dy 3 )µ 3 (dy 31 )µ 3 (dy 3 )ξ(dµ 1 )ξ(dµ )ξ(dµ 3 ). Theorem 1. The basic duality between the process (K t : t 0) and (Ξ t : t 0) is given by E(H(h Kt, ξ)) = E(H(h K 0, Ξ t )). Thanks to the identity (10), it is not difficult to obtain the duality so let us turn to describe what it shows. It will be convenient to view the species as colonies and the genes as individuals. We can now draw the species trees and genes trees in a single picture, indeed a tree with branches painted using as many colors as many colonies exist in the population, see Figure 1. Let us consider a Kingman nested coalescent (K t : t 0) starting in a population completely fragmented into colonies. At time t, we will choose at random out of the total population n individuals from m colonies, so that K t = π, where π g is the trivial partition into singletons and π s is obtained by lumping the individuals block in the same colony. Kingman nested coalescent describes the ancestral lineages backward in time of a population splitted up into colonies. Nevertheless, thanks to duality relation we can view the evolution of the Kingman nested in the forward direction and moreover this forward genealogy corresponds with the two level Fleming Viot process described in Section 1.. We observe that the duality function h π fully characterized both process due to the class consists of functions of the form (4) uniquely determines probability measures on P() and using the partition π we we can read off the configuration of the Kingman nested at every time. Acknowledgements AB acknowledges support from CONACyT. This work was undertaken whilst AB was on a postdoctoral year at Goethe University Frankfurt, she gratefully acknowledges the kind hospitality of the Institute of Mathematics. Specially AB would like to thank, Anton Wakolbinger, for his very helpful advice and encouragement. 6
7 Figure 1: This figure shows the time evolution of sample of 1 individuals which live in three different colonies. References [1] Airam Blancas, Amaury Lambert, Arno Siri-Jégousse (017). Simple nested coalescents. Unpublished manuscript. [] Donald D. Dawson (016). Multilevel mutation-selection systems and set-valued duals. 7
The nested Kingman coalescent: speed of coming down from infinity. by Jason Schweinsberg (University of California at San Diego)
The nested Kingman coalescent: speed of coming down from infinity by Jason Schweinsberg (University of California at San Diego) Joint work with: Airam Blancas Benítez (Goethe Universität Frankfurt) Tim
More informationarxiv: v1 [math.pr] 6 Mar 2018
Trees within trees: Simple nested coalescents arxiv:1803.02133v1 [math.pr] 6 Mar 2018 March 7, 2018 Airam Blancas Benítez 1, Jean-Jil Duchamps 2,3, Amaury Lambert 2,3, Arno Siri-Jégousse 4 1 Institut für
More informationPathwise construction of tree-valued Fleming-Viot processes
Pathwise construction of tree-valued Fleming-Viot processes Stephan Gufler November 9, 2018 arxiv:1404.3682v4 [math.pr] 27 Dec 2017 Abstract In a random complete and separable metric space that we call
More informationLearning Session on Genealogies of Interacting Particle Systems
Learning Session on Genealogies of Interacting Particle Systems A.Depperschmidt, A.Greven University Erlangen-Nuremberg Singapore, 31 July - 4 August 2017 Tree-valued Markov processes Contents 1 Introduction
More informationThe total external length in the evolving Kingman coalescent. Götz Kersting and Iulia Stanciu. Goethe Universität, Frankfurt am Main
The total external length in the evolving Kingman coalescent Götz Kersting and Iulia Stanciu Goethe Universität, Frankfurt am Main CIRM, Luminy June 11 15 2012 The evolving Kingman N-coalescent (N = 5):
More informationThe Λ-Fleming-Viot process and a connection with Wright-Fisher diffusion. Bob Griffiths University of Oxford
The Λ-Fleming-Viot process and a connection with Wright-Fisher diffusion Bob Griffiths University of Oxford A d-dimensional Λ-Fleming-Viot process {X(t)} t 0 representing frequencies of d types of individuals
More informationStochastic flows associated to coalescent processes
Stochastic flows associated to coalescent processes Jean Bertoin (1) and Jean-François Le Gall (2) (1) Laboratoire de Probabilités et Modèles Aléatoires and Institut universitaire de France, Université
More informationON COMPOUND POISSON POPULATION MODELS
ON COMPOUND POISSON POPULATION MODELS Martin Möhle, University of Tübingen (joint work with Thierry Huillet, Université de Cergy-Pontoise) Workshop on Probability, Population Genetics and Evolution Centre
More informationThe mathematical challenge. Evolution in a spatial continuum. The mathematical challenge. Other recruits... The mathematical challenge
The mathematical challenge What is the relative importance of mutation, selection, random drift and population subdivision for standing genetic variation? Evolution in a spatial continuum Al lison Etheridge
More informationEvolution in a spatial continuum
Evolution in a spatial continuum Drift, draft and structure Alison Etheridge University of Oxford Joint work with Nick Barton (Edinburgh) and Tom Kurtz (Wisconsin) New York, Sept. 2007 p.1 Kingman s Coalescent
More informationMathematical models in population genetics II
Mathematical models in population genetics II Anand Bhaskar Evolutionary Biology and Theory of Computing Bootcamp January 1, 014 Quick recap Large discrete-time randomly mating Wright-Fisher population
More informationDynamics of the evolving Bolthausen-Sznitman coalescent. by Jason Schweinsberg University of California at San Diego.
Dynamics of the evolving Bolthausen-Sznitman coalescent by Jason Schweinsberg University of California at San Diego Outline of Talk 1. The Moran model and Kingman s coalescent 2. The evolving Kingman s
More informationGene Genealogies Coalescence Theory. Annabelle Haudry Glasgow, July 2009
Gene Genealogies Coalescence Theory Annabelle Haudry Glasgow, July 2009 What could tell a gene genealogy? How much diversity in the population? Has the demographic size of the population changed? How?
More informationThe tree-valued Fleming-Viot process with mutation and selection
The tree-valued Fleming-Viot process with mutation and selection Peter Pfaffelhuber University of Freiburg Joint work with Andrej Depperschmidt and Andreas Greven Population genetic models Populations
More informationThe Combinatorial Interpretation of Formulas in Coalescent Theory
The Combinatorial Interpretation of Formulas in Coalescent Theory John L. Spouge National Center for Biotechnology Information NLM, NIH, DHHS spouge@ncbi.nlm.nih.gov Bldg. A, Rm. N 0 NCBI, NLM, NIH Bethesda
More information1 Random Walks and Electrical Networks
CME 305: Discrete Mathematics and Algorithms Random Walks and Electrical Networks Random walks are widely used tools in algorithm design and probabilistic analysis and they have numerous applications.
More informationSome mathematical models from population genetics
Some mathematical models from population genetics 5: Muller s ratchet and the rate of adaptation Alison Etheridge University of Oxford joint work with Peter Pfaffelhuber (Vienna), Anton Wakolbinger (Frankfurt)
More informationarxiv: v1 [math.pr] 29 Jul 2014
Sample genealogy and mutational patterns for critical branching populations Guillaume Achaz,2,3 Cécile Delaporte 3,4 Amaury Lambert 3,4 arxiv:47.772v [math.pr] 29 Jul 24 Abstract We study a universal object
More informationStochastic Population Models: Measure-Valued and Partition-Valued Formulations
Stochastic Population Models: Measure-Valued and Partition-Valued Formulations Diplomarbeit Humboldt-Universität zu Berlin Mathematisch-aturwissenschaftliche Fakultät II Institut für Mathematik eingereicht
More informationThe Moran Process as a Markov Chain on Leaf-labeled Trees
The Moran Process as a Markov Chain on Leaf-labeled Trees David J. Aldous University of California Department of Statistics 367 Evans Hall # 3860 Berkeley CA 94720-3860 aldous@stat.berkeley.edu http://www.stat.berkeley.edu/users/aldous
More informationStochastic Demography, Coalescents, and Effective Population Size
Demography Stochastic Demography, Coalescents, and Effective Population Size Steve Krone University of Idaho Department of Mathematics & IBEST Demographic effects bottlenecks, expansion, fluctuating population
More informationHow robust are the predictions of the W-F Model?
How robust are the predictions of the W-F Model? As simplistic as the Wright-Fisher model may be, it accurately describes the behavior of many other models incorporating additional complexity. Many population
More informationTwo viewpoints on measure valued processes
Two viewpoints on measure valued processes Olivier Hénard Université Paris-Est, Cermics Contents 1 The classical framework : from no particle to one particle 2 The lookdown framework : many particles.
More informationLecture 18 : Ewens sampling formula
Lecture 8 : Ewens sampling formula MATH85K - Spring 00 Lecturer: Sebastien Roch References: [Dur08, Chapter.3]. Previous class In the previous lecture, we introduced Kingman s coalescent as a limit of
More informationMeasure-valued diffusions, general coalescents and population genetic inference 1
Measure-valued diffusions, general coalescents and population genetic inference 1 Matthias Birkner 2, Jochen Blath 3 Abstract: We review recent progress in the understanding of the interplay between population
More informationThe effects of a weak selection pressure in a spatially structured population
The effects of a weak selection pressure in a spatially structured population A.M. Etheridge, A. Véber and F. Yu CNRS - École Polytechnique Motivations Aim : Model the evolution of the genetic composition
More informationGibbs distributions for random partitions generated by a fragmentation process
Gibbs distributions for random partitions generated by a fragmentation process Nathanaël Berestycki and Jim Pitman University of British Columbia, and Department of Statistics, U.C. Berkeley July 24, 2006
More informationarxiv: v1 [math.pr] 8 Mar 2017
The hierarchical Cannings process in random environment A. Greven 1, F. den Hollander 2, A. Klimovsky 3 September 10, 2018 arxiv:1703.03061v1 [math.pr] 8 Mar 2017 Abstract In an earlier paper, we introduced
More information6 Introduction to Population Genetics
70 Grundlagen der Bioinformatik, SoSe 11, D. Huson, May 19, 2011 6 Introduction to Population Genetics This chapter is based on: J. Hein, M.H. Schierup and C. Wuif, Gene genealogies, variation and evolution,
More informationAn Ergodic Theorem for Fleming-Viot Models in Random Environments 1
An Ergodic Theorem for Fleming-Viot Models in Random Environments 1 Arash Jamshidpey 2 216 Abstract The Fleming-Viot (FV) process is a measure-valued diffusion that models the evolution of type frequencies
More informationINTRODUCTION TO FURSTENBERG S 2 3 CONJECTURE
INTRODUCTION TO FURSTENBERG S 2 3 CONJECTURE BEN CALL Abstract. In this paper, we introduce the rudiments of ergodic theory and entropy necessary to study Rudolph s partial solution to the 2 3 problem
More informationComputational Graphs, and Backpropagation. Michael Collins, Columbia University
Computational Graphs, and Backpropagation Michael Collins, Columbia University A Key Problem: Calculating Derivatives where and p(y x; θ, v) = exp (v(y) φ(x; θ) + γ y ) y Y exp (v(y ) φ(x; θ) + γ y ) φ(x;
More informationMean field simulation for Monte Carlo integration. Part II : Feynman-Kac models. P. Del Moral
Mean field simulation for Monte Carlo integration Part II : Feynman-Kac models P. Del Moral INRIA Bordeaux & Inst. Maths. Bordeaux & CMAP Polytechnique Lectures, INLN CNRS & Nice Sophia Antipolis Univ.
More informationEVOLUTIONARY DISTANCES
EVOLUTIONARY DISTANCES FROM STRINGS TO TREES Luca Bortolussi 1 1 Dipartimento di Matematica ed Informatica Università degli studi di Trieste luca@dmi.units.it Trieste, 14 th November 2007 OUTLINE 1 STRINGS:
More information6 Introduction to Population Genetics
Grundlagen der Bioinformatik, SoSe 14, D. Huson, May 18, 2014 67 6 Introduction to Population Genetics This chapter is based on: J. Hein, M.H. Schierup and C. Wuif, Gene genealogies, variation and evolution,
More informationTreball final de grau GRAU DE MATEMÀTIQUES Facultat de Matemàtiques Universitat de Barcelona MARKOV CHAINS
Treball final de grau GRAU DE MATEMÀTIQUES Facultat de Matemàtiques Universitat de Barcelona MARKOV CHAINS Autor: Anna Areny Satorra Director: Dr. David Márquez Carreras Realitzat a: Departament de probabilitat,
More informationMean-field dual of cooperative reproduction
The mean-field dual of systems with cooperative reproduction joint with Tibor Mach (Prague) A. Sturm (Göttingen) Friday, July 6th, 2018 Poisson construction of Markov processes Let (X t ) t 0 be a continuous-time
More informationA modified lookdown construction for the Xi-Fleming-Viot process with mutation and populations with recurrent bottlenecks
Alea 6, 25 61 (2009) A modified lookdown construction for the Xi-Fleming-Viot process with mutation and populations with recurrent bottlenecks Matthias Birkner, Jochen Blath, Martin Möhle, Matthias Steinrücken
More informationYaglom-type limit theorems for branching Brownian motion with absorption. by Jason Schweinsberg University of California San Diego
Yaglom-type limit theorems for branching Brownian motion with absorption by Jason Schweinsberg University of California San Diego (with Julien Berestycki, Nathanaël Berestycki, Pascal Maillard) Outline
More informationarxiv: v2 [math.pr] 4 Sep 2017
arxiv:1708.08576v2 [math.pr] 4 Sep 2017 On the Speed of an Excited Asymmetric Random Walk Mike Cinkoske, Joe Jackson, Claire Plunkett September 5, 2017 Abstract An excited random walk is a non-markovian
More informationFrequency Spectra and Inference in Population Genetics
Frequency Spectra and Inference in Population Genetics Although coalescent models have come to play a central role in population genetics, there are some situations where genealogies may not lead to efficient
More informationDemography April 10, 2015
Demography April 0, 205 Effective Population Size The Wright-Fisher model makes a number of strong assumptions which are clearly violated in many populations. For example, it is unlikely that any population
More informationThe genealogy of branching Brownian motion with absorption. by Jason Schweinsberg University of California at San Diego
The genealogy of branching Brownian motion with absorption by Jason Schweinsberg University of California at San Diego (joint work with Julien Berestycki and Nathanaël Berestycki) Outline 1. A population
More informationComputing likelihoods under Λ-coalescents
Computing likelihoods under Λ-coalescents Matthias Birkner LMU Munich, Dept. Biology II Joint work with Jochen Blath and Matthias Steinrücken, TU Berlin New Mathematical Challenges from Molecular Biology,
More informationAn extended version of the Carathéodory extension Theorem
An extended version of the Carathéodory extension Theorem Alexandre G. Patriota Departamento de Estatística, Universidade de São Paulo, São Paulo/SP, 05508-090, Brazil Abstract In this paper, we show that
More informationIntroduction to self-similar growth-fragmentations
Introduction to self-similar growth-fragmentations Quan Shi CIMAT, 11-15 December, 2017 Quan Shi Growth-Fragmentations CIMAT, 11-15 December, 2017 1 / 34 Literature Jean Bertoin, Compensated fragmentation
More informationThe Wright-Fisher Model and Genetic Drift
The Wright-Fisher Model and Genetic Drift January 22, 2015 1 1 Hardy-Weinberg Equilibrium Our goal is to understand the dynamics of allele and genotype frequencies in an infinite, randomlymating population
More informationModelling populations under fluctuating selection
Modelling populations under fluctuating selection Alison Etheridge With Aleksander Klimek (Oxford) and Niloy Biswas (Harvard) The simplest imaginable model of inheritance A population of fixed size, N,
More informationMathematical Biology. Computing likelihoods for coalescents with multiple collisions in the infinitely many sites model. Matthias Birkner Jochen Blath
J. Math. Biol. DOI 0.007/s00285-008-070-6 Mathematical Biology Computing likelihoods for coalescents with multiple collisions in the infinitely many sites model Matthias Birkner Jochen Blath Received:
More informationCrump Mode Jagers processes with neutral Poissonian mutations
Crump Mode Jagers processes with neutral Poissonian mutations Nicolas Champagnat 1 Amaury Lambert 2 1 INRIA Nancy, équipe TOSCA 2 UPMC Univ Paris 06, Laboratoire de Probabilités et Modèles Aléatoires Paris,
More informationMixing Times and Hitting Times
Mixing Times and Hitting Times David Aldous January 12, 2010 Old Results and Old Puzzles Levin-Peres-Wilmer give some history of the emergence of this Mixing Times topic in the early 1980s, and we nowadays
More informationFrom Individual-based Population Models to Lineage-based Models of Phylogenies
From Individual-based Population Models to Lineage-based Models of Phylogenies Amaury Lambert (joint works with G. Achaz, H.K. Alexander, R.S. Etienne, N. Lartillot, H. Morlon, T.L. Parsons, T. Stadler)
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationANCESTRAL PROCESSES WITH SELECTION: BRANCHING AND MORAN MODELS
**************************************** BANACH CENTER PUBLICATIONS, VOLUME ** INSTITUTE OF MATHEMATICS Figure POLISH ACADEMY OF SCIENCES WARSZAWA 2* ANCESTRAL PROCESSES WITH SELECTION: BRANCHING AND MORAN
More informationEvolutionary dynamics on graphs
Evolutionary dynamics on graphs Laura Hindersin May 4th 2015 Max-Planck-Institut für Evolutionsbiologie, Plön Evolutionary dynamics Main ingredients: Fitness: The ability to survive and reproduce. Selection
More informationRW in dynamic random environment generated by the reversal of discrete time contact process
RW in dynamic random environment generated by the reversal of discrete time contact process Andrej Depperschmidt joint with Matthias Birkner, Jiří Černý and Nina Gantert Ulaanbaatar, 07/08/2015 Motivation
More informationGenetic Algorithms: Basic Principles and Applications
Genetic Algorithms: Basic Principles and Applications C. A. MURTHY MACHINE INTELLIGENCE UNIT INDIAN STATISTICAL INSTITUTE 203, B.T.ROAD KOLKATA-700108 e-mail: murthy@isical.ac.in Genetic algorithms (GAs)
More informationOptimal filtering and the dual process
Optimal filtering and the dual process Omiros Papaspiliopoulos ICREA & Universitat Pompeu Fabra Joint work with Matteo Ruggiero Collegio Carlo Alberto & University of Turin The filtering problem X t0 X
More informationLatent voter model on random regular graphs
Latent voter model on random regular graphs Shirshendu Chatterjee Cornell University (visiting Duke U.) Work in progress with Rick Durrett April 25, 2011 Outline Definition of voter model and duality with
More informationarxiv: v3 [math.pr] 30 May 2013
FROM FLOWS OF Λ FLEMING-VIOT PROCESSES TO LOOKDOWN PROCESSES VIA FLOWS OF PARTITIONS Cyril LABBÉ Université Pierre et Marie Curie May 31, 2013 arxiv:1107.3419v3 [math.pr] 30 May 2013 Abstract The goal
More informationEstimating Evolutionary Trees. Phylogenetic Methods
Estimating Evolutionary Trees v if the data are consistent with infinite sites then all methods should yield the same tree v it gets more complicated when there is homoplasy, i.e., parallel or convergent
More informationOn semilinear elliptic equations with measure data
On semilinear elliptic equations with measure data Andrzej Rozkosz (joint work with T. Klimsiak) Nicolaus Copernicus University (Toruń, Poland) Controlled Deterministic and Stochastic Systems Iasi, July
More informationStochastic Loewner evolution with branching and the Dyson superprocess
Stochastic Loewner evolution with branching and the Dyson superprocess Govind Menon (Brown University) Vivian Olsiewski Healey (Brown/University of Chicago) This talk is based on Vivian's Ph.D thesis (May
More informationReceived: 2/7/07, Revised: 5/25/07, Accepted: 6/25/07, Published: 7/20/07 Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 2007, #A34 AN INVERSE OF THE FAÀ DI BRUNO FORMULA Gottlieb Pirsic 1 Johann Radon Institute of Computational and Applied Mathematics RICAM,
More informationFacets for Node-Capacitated Multicut Polytopes from Path-Block Cycles with Two Common Nodes
Facets for Node-Capacitated Multicut Polytopes from Path-Block Cycles with Two Common Nodes Michael M. Sørensen July 2016 Abstract Path-block-cycle inequalities are valid, and sometimes facet-defining,
More informationLOCAL TIMES OF RANKED CONTINUOUS SEMIMARTINGALES
LOCAL TIMES OF RANKED CONTINUOUS SEMIMARTINGALES ADRIAN D. BANNER INTECH One Palmer Square Princeton, NJ 8542, USA adrian@enhanced.com RAOUF GHOMRASNI Fakultät II, Institut für Mathematik Sekr. MA 7-5,
More informationVC-DENSITY FOR TREES
VC-DENSITY FOR TREES ANTON BOBKOV Abstract. We show that for the theory of infinite trees we have vc(n) = n for all n. VC density was introduced in [1] by Aschenbrenner, Dolich, Haskell, MacPherson, and
More informationarxiv: v1 [math.pr] 18 Sep 2007
arxiv:0709.2775v [math.pr] 8 Sep 2007 How often does the ratchet click? Facts, heuristics, asymptotics. by A. Etheridge, P. Pfaffelhuber and A. Wakolbinger University of Oxford, Ludwig-Maximilians University
More informationAutomata on linear orderings
Automata on linear orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 September 25, 2006 Abstract We consider words indexed by linear
More informationSMSTC (2007/08) Probability.
SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................
More informationarxiv: v1 [math.pr] 20 Dec 2017
On the time to absorption in Λ-coalescents Götz Kersting and Anton Wakolbinger arxiv:72.7553v [math.pr] 2 Dec 27 Abstract We present a law of large numbers and a central limit theorem for the time to absorption
More informationGeneralized Fleming-Viot processes with immigration via stochastic flows of partitions
ALEA, Lat. Am. J. Probab. Math. Stat. 9(2), 451 472(2012) Generalized Fleming-Viot processes with immigration via stochastic flows of partitions Clément Foucart Laboratoire de Probabilités et Modèles Aléatoires
More informationSupplementary Material to Full Likelihood Inference from the Site Frequency Spectrum based on the Optimal Tree Resolution
Supplementary Material to Full Likelihood Inference from the Site Frequency Spectrum based on the Optimal Tree Resolution Raazesh Sainudiin, Amandine Véber 1 Pseudo-code First, the global process MakeHistory
More informationEXCHANGEABLE COALESCENTS. Jean BERTOIN
EXCHANGEABLE COALESCENTS Jean BERTOIN Nachdiplom Lectures ETH Zürich, Autumn 2010 The purpose of this series of lectures is to introduce and develop some of the main aspects of a class of random processes
More informationResults and open problems related to Schmidt s Subspace Theorem. Jan-Hendrik Evertse
Results and open problems related to Schmidt s Subspace Theorem Jan-Hendrik Evertse Universiteit Leiden 29 ièmes Journées Arithmétiques July 6, 2015, Debrecen Slides can be downloaded from http://pub.math.leidenuniv.nl/
More informationFinal Exam: Probability Theory (ANSWERS)
Final Exam: Probability Theory ANSWERS) IST Austria February 015 10:00-1:30) Instructions: i) This is a closed book exam ii) You have to justify your answers Unjustified results even if correct will not
More informationWorkshop on Stochastic Processes and Random Trees
Workshop on Stochastic Processes and Random Trees Program and abstracts October 11 12, 2018 TU Dresden, Germany Program Thursday, October 11 09:00 09:45 Rudolf Grübel: From algorithms to arbotons 09:45
More informationRandom self-similar trees and their applications
Random self-similar trees and their applications Ilya Zaliapin Department of Mathematics and Statistics University of Nevada, Reno Frontier Probability Days March 31, 2018 Co-author: Yevgeniy Kovchegov
More informationarxiv:math.pr/ v1 17 May 2004
Probabilistic Analysis for Randomized Game Tree Evaluation Tämur Ali Khan and Ralph Neininger arxiv:math.pr/0405322 v1 17 May 2004 ABSTRACT: We give a probabilistic analysis for the randomized game tree
More informationA CHARACTERIZATION OF ANCESTRAL LIMIT PROCESSES ARISING IN HAPLOID. Abstract. conditions other limit processes do appear, where multiple mergers of
A CHARACTERIATIO OF ACESTRAL LIMIT PROCESSES ARISIG I HAPLOID POPULATIO GEETICS MODELS M. Mohle, Johannes Gutenberg-University, Mainz and S. Sagitov 2, Chalmers University of Technology, Goteborg Abstract
More informationStepping-Stone Model with Circular Brownian Migration
Canad. Math. Bull. Vol. 51 (1), 2008 pp. 146 160 Stepping-Stone Model with Circular Brownian Migration Xiaowen Zhou Abstract. In this paper we consider the stepping-stone model on a circle with circular
More informationKrzysztof Burdzy Robert Ho lyst Peter March
A FLEMING-VIOT PARTICLE REPRESENTATION OF THE DIRICHLET LAPLACIAN Krzysztof Burdzy Robert Ho lyst Peter March Abstract: We consider a model with a large number N of particles which move according to independent
More information1.3 Forward Kolmogorov equation
1.3 Forward Kolmogorov equation Let us again start with the Master equation, for a system where the states can be ordered along a line, such as the previous examples with population size n = 0, 1, 2,.
More informationarxiv: v3 [math.pr] 30 Dec 2015
arxiv: math.pr/1402.1769 The fixation time of a strongly beneficial allele in a structured population arxiv:1402.1769v3 [math.pr] 30 Dec 2015 Andreas Greven, Peter Pfaffelhuber, Cornelia Pokalyuk and Anton
More informationHOMOGENEOUS CUT-AND-PASTE PROCESSES
HOMOGENEOUS CUT-AND-PASTE PROCESSES HARRY CRANE Abstract. We characterize the class of exchangeable Feller processes on the space of partitions with a bounded number of blocks. This characterization leads
More informationCounting All Possible Ancestral Configurations of Sample Sequences in Population Genetics
1 Counting All Possible Ancestral Configurations of Sample Sequences in Population Genetics Yun S. Song, Rune Lyngsø, and Jotun Hein Abstract Given a set D of input sequences, a genealogy for D can be
More informationBy Jochen Blath 1, Adrián González Casanova 2, Noemi Kurt 1 and Maite Wilke-Berenguer 3 Technische Universität Berlin
The Annals of Applied Probability 2016, Vol. 26, No. 2, 857 891 DOI: 10.1214/15-AAP1106 c Institute of Mathematical Statistics, 2016 A NEW COALESCENT FOR SEED-BANK MODELS arxiv:1411.4747v3 [math.pr] 4
More informationThe range of tree-indexed random walk
The range of tree-indexed random walk Jean-François Le Gall, Shen Lin Institut universitaire de France et Université Paris-Sud Orsay Erdös Centennial Conference July 2013 Jean-François Le Gall (Université
More informationLecture 21. David Aldous. 16 October David Aldous Lecture 21
Lecture 21 David Aldous 16 October 2015 In continuous time 0 t < we specify transition rates or informally P(X (t+δ)=j X (t)=i, past ) q ij = lim δ 0 δ P(X (t + dt) = j X (t) = i) = q ij dt but note these
More informationMathematical Population Genetics II
Mathematical Population Genetics II Lecture Notes Joachim Hermisson March 20, 2015 University of Vienna Mathematics Department Oskar-Morgenstern-Platz 1 1090 Vienna, Austria Copyright (c) 2013/14/15 Joachim
More informationRenormalisation of hierarchically interacting Cannings processes
Renormalisation of hierarchically interacting Cannings processes A. Greven 1 F. den Hollander 2 S. Kliem 3 A. Klimovsky 2 September 11, 2012 Abstract In order to analyse universal patterns in the large
More informationProcesses of Evolution
15 Processes of Evolution Forces of Evolution Concept 15.4 Selection Can Be Stabilizing, Directional, or Disruptive Natural selection can act on quantitative traits in three ways: Stabilizing selection
More informationThe BRST complex for a group action
BRST 2006 (jmf) 23 Lecture 3: The BRST complex for a group action In this lecture we will start our discussion of the homological approach to coisotropic reduction by studying the case where the coisotropic
More informationWigner s semicircle law
CHAPTER 2 Wigner s semicircle law 1. Wigner matrices Definition 12. A Wigner matrix is a random matrix X =(X i, j ) i, j n where (1) X i, j, i < j are i.i.d (real or complex valued). (2) X i,i, i n are
More informationMathematics of Life. Henry Steyer. address: URL:
Mathematics of Life Henry Steyer E-mail address: henry.steyer@freenet.de URL: http://www.mathematicsoflife.net Copyright c 2009-2012 Henry Steyer. All rights reserved typesetting LATEX Contents Preface
More informationA CLT FOR MULTI-DIMENSIONAL MARTINGALE DIFFERENCES IN A LEXICOGRAPHIC ORDER GUY COHEN. Dedicated to the memory of Mikhail Gordin
A CLT FOR MULTI-DIMENSIONAL MARTINGALE DIFFERENCES IN A LEXICOGRAPHIC ORDER GUY COHEN Dedicated to the memory of Mikhail Gordin Abstract. We prove a central limit theorem for a square-integrable ergodic
More informationSEEDS AND WEIGHTED QUIVERS. 1. Seeds
SEEDS AND WEIGHTED QUIVERS TSUKASA ISHIBASHI Abstract. In this note, we describe the correspondence between (skew-symmetrizable) seeds and weighted quivers. Also we review the construction of the seed
More informationSurfing genes. On the fate of neutral mutations in a spreading population
Surfing genes On the fate of neutral mutations in a spreading population Oskar Hallatschek David Nelson Harvard University ohallats@physics.harvard.edu Genetic impact of range expansions Population expansions
More information3. The Voter Model. David Aldous. June 20, 2012
3. The Voter Model David Aldous June 20, 2012 We now move on to the voter model, which (compared to the averaging model) has a more substantial literature in the finite setting, so what s written here
More informationExample: physical systems. If the state space. Example: speech recognition. Context can be. Example: epidemics. Suppose each infected
4. Markov Chains A discrete time process {X n,n = 0,1,2,...} with discrete state space X n {0,1,2,...} is a Markov chain if it has the Markov property: P[X n+1 =j X n =i,x n 1 =i n 1,...,X 0 =i 0 ] = P[X
More information