The tree-valued Fleming-Viot process with mutation and selection
|
|
- Brent Goodwin
- 5 years ago
- Views:
Transcription
1 The tree-valued Fleming-Viot process with mutation and selection Peter Pfaffelhuber University of Freiburg Joint work with Andrej Depperschmidt and Andreas Greven
2 Population genetic models Populations of constant size have been modelled by Markov Chains (Wright-Fisher-model, Moran model) Diffusion approximations (Fisher-Wright diffusion) dx = αx (1 X )dt + X (1 X )dw or Measure-valued diffusions (Fleming-Viot superprocess) New: Extend Fleming-Viot process by genealogical information Tree-valued Fleming-Viot process
3 The Moran model with mutation and selection time resampling, rate 1 per pair mutation, rate ϑ/2 selection, rate α/n per pair only can use selective arrow Goal: construct a tree-valued stochastic process U = (U t ) t 0 describes genealogical relationships dynamically makes forward and backward picture implicit
4 The Moran model with mutation and selection time resampling, rate 1 per pair mutation, rate ϑ/2 selection, rate α/n per pair only can use selective arrow Goal: construct a tree-valued stochastic process U = (U t ) t 0 describes genealogical relationships dynamically makes forward and backward picture implicit
5 The Moran model with mutation and selection time Goal: construct a tree-valued stochastic process U = (U t ) t 0 describe genealogical relationships dynamically make forward and backward picture implicit
6 The Moran model with mutation and selection time t s Goal: construct a tree-valued stochastic process U = (U t ) t 0 describe genealogical relationships dynamically make forward and backward picture implicit
7 The Moran model with mutation and selection time t s Goal: construct a tree-valued stochastic process U = (U t ) t 0 describe genealogical relationships dynamically make forward and backward picture implicit
8 Summary: The tree-valued Fleming-Viot process Theorem: The (Ω, Π)-martingale problem is well-posed. Its solution the tree-valued Fleming-Viot process arises as weak limit of tree-valued Moran models. Theorem: Tree-valued processes for different α are absolutely continuous with respect to each other. Theorem: The measure-valued Fleming-Viot process is ergodic iff the tree-valued Fleming-Viot process is ergodic. Theorem: The distribution of R12 α, the distance of two randomly sampled points in equilibrium, can be computed.
9 Formalizing genealogical trees Leaves in genealogical trees form a metric space; leaves are marked by elements of I (compact) A tree is given by:state space of U: U :={isometry class of (X, r, µ) : (X, r) complete and separable metric space, µ P(X I )} r(x 1, x 2 ) defines the genealogical distance of individuals x 1 and x 2 µ marks currently living individuals
10 Formalizing genealogical trees Leaves in genealogical trees form a metric space; leaves are marked by elements of I (compact) A tree is given by:state space of U: X :={isometry class of (X, r, µ) : (X, r) complete and separable metric space, µ P(X I )} r(x 1, x 2 ) defines the genealogical distance of individuals x 1 and x 2 µ marks currently living individuals
11 Formalizing genealogical trees Leaves in genealogical trees form a metric space; leaves are marked by elements of I (compact) A tree is given by:state space of U: X :={isometry class of (X, r, µ) : (X, r) complete and separable metric space, µ P(X I )} r(x 1, x 2 ) defines the genealogical distance of individuals x 1 and x 2 µ marks currently living individuals
12 Formalizing genealogical trees Leaves in genealogical trees form a metric space; leaves are marked by elements of I (compact) State space of U: X :={isometry class of (X, r, µ) : (X, r) complete and separable metric space, µ P(X I )} r(x 1, x 2 ) defines the genealogical distance of individuals x 1 and x 2 µ marks currently living individuals
13 Martingale Problem Given: Markov process X = (X t ) t 0. The generator is 1 ΩΦ(x) := lim h 0 h E x[φ(x h ) Φ(x)]. Given: Operator Ω on Π. A solution of the (Ω, Π)-martingale problem is a process X = (X t ) t 0 if for all Φ Π, ( t ) Φ(X t ) ΩΦ(X s )ds 0 t 0 is a martingale. The MP is well-posed if there is exactly one such process.
14 Polynomials on P(I ) Π: functions on U of the form (polynomials) Φ ( X, r,µ ) := µ N, φ := φ ( r(x, x),u ) µ N (d(x,u)) for (x,u) = ((x 1,u 1 ), (x 2,u 2 ),...), φ C b (R (N 2) I N ) depending on finitely many coordinates Π separates points in P(I )
15 Polynomials on U Π: functions on U of the form (polynomials) Φ ( X, r,µ ) := µ N, φ := φ ( r(x, x),u ) µ N (d(x,u)) for (x,u) = ((x 1,u 1 ), (x 2,u 2 ),...), φ C b (R (N 2) I N ) depending on finitely many coordinates Π separates points in X
16 Generator for the Fleming-Viot process: measure-valued Ω := Ω grow +Ω res + Ω mut + Ω sel Ω grow : tree growth Ω res : resampling Ω mut : mutation Ω sel : selection
17 Generator for the Fleming-Viot process: tree-valued Ω := Ω grow +Ω res + Ω mut + Ω sel Ω grow : tree growth Ω res : resampling Ω mut : mutation Ω sel : selection
18 Tree Growth When no resampling occurs the tree grows ε Time ε passes.. sample. full tree Distances in the sample grow at speed 2 Ω grow Φ(X, r, µ) = 2 µ N, i<j φ. r ij
19 Resampling: measure-valued Ω res Φ(X, r,µ):= k<l µ N, φ θ k,l φ with (θ k,l (u)) i := { u i, u k, i l i = l In addition, r(x i, x j ), if i, j l, (θ k,l r(x, x)) i,j := r(x i, x k ), if j = l, r(x k, x j ), if i = l,
20 Resampling: tree-valued Ω res Φ(X, r,µ):= k<l µ N, φ θ k,l φ with (θ k,l (u)) i := { u i, u k, i l i = l In addition, r(x i, x j ), if i, j l, (θ k,l r(x, x)) i,j := r(x i, x k ), if j = l, r(x k, x j ), if i = l,
21 Mutation: measure-valued ϑ: total mutation rate ϑ β(u, dv): mutation rate from u to v Ω mut Φ(X, r,µ)= ϑ µ N, β k φ φ with β k (u, dv) acting on kth variable k
22 Mutation: tree-valued ϑ: total mutation rate ϑ β(u, dv): mutation rate from u to v Ω mut Φ(X, r,µ)= ϑ µ N, β k φ φ with β k (u, dv) acting on kth variable k
23 Selection: measure-valued α: selection coefficient χ(u) [0, 1]: fitness of type u (continuous) Ω sel Φ(X, r,µ) := α n µ N, χ k φ χ n+1 φ k=1 where φ only depends on sample of size n with χ k acting on kth variable
24 Selection: tree-valued α: selection coefficient χ(u) [0, 1]: fitness of type u (continuous) Ω sel Φ(X, r,µ) := α n µ N, χ k φ χ n+1 φ k=1 where φ only depends on sample of size n with χ k acting on kth variable
25 Selection: tree-valued Why is selection the same as for measure-valued case? Ω sel N : generator for finite model of size N φ: only depends on first n N individuals Ω sel N Φ(X, r, µ) α N α = α N µ N, χ k (φ θ k,l φ) k,l=1 n µ N, χ n+1 (φ θ n+1,l φ) l=1 n µ N, χ l φ χ n+1 φ l=1
26 The tree-valued Fleming-Viot process Theorem: The (Ω, Π)-martingale problem is well-posed. Its solution X = (X t ) 0, X t = (X t, r t, µ t ) the tree-valued Fleming-Viot process arises as weak limit of tree-valued Moran models and satisfies: P(t Xt is continuous) = 1, P((Xt, r t ) is compact for all t > 0) = 1, X is Feller (hence strong Markov)
27 Girsanov transform: measure-valued Theorem: Let α, α R, X solution of (Ω, Π)-MP for selection coefficient α, and M = Ψ(X, r,µ) := (α α) µ N, χ 1 ( t ) Ψ(X t, r t,µ t ) Ψ(X 0, r 0,µ 0 ) ΩΨ(X s, r s,µ s )ds. 0 t 0 Then, Q, defined by dq = e Mt 1 2 [M]t dp Ft solves (Ω, Π)-MP for selection coefficient α
28 Girsanov transform: tree-valued Theorem: Let α, α R, X solution of (Ω, Π)-MP for selection coefficient α, and M = Ψ(X, r,µ) := (α α) µ N, χ 1 ( t ) Ψ(X t, r t,µ t ) Ψ(X 0, r 0,µ 0 ) ΩΨ(X s, r s,µ s )ds. 0 t 0 Then, Q, defined by dq = e Mt 1 2 [M]t dp Ft solves (Ω, Π)-MP for selection coefficient α
29 Long-time behavior Theorem: The tree-valued Fleming-Viot process is ergodic iff the measure-valued Fleming-Viot process is ergodic
30 Application: distances is equilibrium Theorem: I = {, }, χ(u) = 1{u= } ( is fit, is unfit) ϑ 2 : mutation rate and R12 α : distance of two randomly sampled points in equilibrium E[e λrα 12 /2 ] = λ 4ϑ(2 + λ + 2ϑ)λ + (1 + ϑ)(1 + λ + ϑ)(6 + λ + ϑ)(1 + λ)(6 + 2λ + ϑ) α2 + O(α 3 ) Proof: Use E[Ω µ N, e λr(x 1,x 2 )/2 ] = 0
31 Summary and outlook Once the right state-space is chosen, construction of tree-valued Fleming-Viot process straight-forward Genealogical distances can be computed using generators Next step: Include recombination
Frequency 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 informationVerona Course April Lecture 1. Review of probability
Verona Course April 215. Lecture 1. Review of probability Viorel Barbu Al.I. Cuza University of Iaşi and the Romanian Academy A probability space is a triple (Ω, F, P) where Ω is an abstract set, F is
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 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 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 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 informationContinuous dependence estimates for the ergodic problem with an application to homogenization
Continuous dependence estimates for the ergodic problem with an application to homogenization Claudio Marchi Bayreuth, September 12 th, 2013 C. Marchi (Università di Padova) Continuous dependence Bayreuth,
More informationAn Introduction to Malliavin calculus and its applications
An Introduction to Malliavin calculus and its applications Lecture 3: Clark-Ocone formula David Nualart Department of Mathematics Kansas University University of Wyoming Summer School 214 David Nualart
More informationPopulation Genetics: a tutorial
: a tutorial Institute for Science and Technology Austria ThRaSh 2014 provides the basic mathematical foundation of evolutionary theory allows a better understanding of experiments allows the development
More informationON THE DIFFUSION OPERATOR IN POPULATION GENETICS
J. Appl. Math. & Informatics Vol. 30(2012), No. 3-4, pp. 677-683 Website: http://www.kcam.biz ON THE DIFFUSION OPERATOR IN POPULATION GENETICS WON CHOI Abstract. W.Choi([1]) obtains a complete description
More informationp 1 ( Y p dp) 1/p ( X p dp) 1 1 p
Doob s inequality Let X(t) be a right continuous submartingale with respect to F(t), t 1 P(sup s t X(s) λ) 1 λ {sup s t X(s) λ} X + (t)dp 2 For 1 < p
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 informationWright-Fisher Processes
Chapter 5 Wright-Fisher Processes Figure 5.1: Fisher and Wright 5.1 Introductory remarks The BGW processes and birth and death processes we have studied in the previous chapters have the property that
More informationMutation-Selection Systems
Chapter 12 Mutation-Selection Systems The basic mechanisms of population biology are mutation, selection, recombination and genetic drift. In the previous chapter we concentrated on mutation and genetic
More informationOn Ergodic Impulse Control with Constraint
On Ergodic Impulse Control with Constraint Maurice Robin Based on joint papers with J.L. Menaldi University Paris-Sanclay 9119 Saint-Aubin, France (e-mail: maurice.robin@polytechnique.edu) IMA, Minneapolis,
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 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 informationPROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS
PROBABILITY: LIMIT THEOREMS II, SPRING 15. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please
More informationPROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS
PROBABILITY: LIMIT THEOREMS II, SPRING 218. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please
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 informationApplied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.
Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define
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 informationA representation for the semigroup of a two-level Fleming Viot process in terms of the Kingman nested coalescent
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
More informationThe Smoluchowski-Kramers Approximation: What model describes a Brownian particle?
The Smoluchowski-Kramers Approximation: What model describes a Brownian particle? Scott Hottovy shottovy@math.arizona.edu University of Arizona Applied Mathematics October 7, 2011 Brown observes a particle
More informationDerivation of Itô SDE and Relationship to ODE and CTMC Models
Derivation of Itô SDE and Relationship to ODE and CTMC Models Biomathematics II April 23, 2015 Linda J. S. Allen Texas Tech University TTU 1 Euler-Maruyama Method for Numerical Solution of an Itô SDE dx(t)
More informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationKolmogorov Equations and Markov Processes
Kolmogorov Equations and Markov Processes May 3, 013 1 Transition measures and functions Consider a stochastic process {X(t)} t 0 whose state space is a product of intervals contained in R n. We define
More information1. Stochastic Processes and filtrations
1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S
More informationLogFeller et Ray Knight
LogFeller et Ray Knight Etienne Pardoux joint work with V. Le and A. Wakolbinger Etienne Pardoux (Marseille) MANEGE, 18/1/1 1 / 16 Feller s branching diffusion with logistic growth We consider the diffusion
More informationLecture 12: Detailed balance and Eigenfunction methods
Miranda Holmes-Cerfon Applied Stochastic Analysis, Spring 2015 Lecture 12: Detailed balance and Eigenfunction methods Readings Recommended: Pavliotis [2014] 4.5-4.7 (eigenfunction methods and reversibility),
More informationWeak convergence and large deviation theory
First Prev Next Go To Go Back Full Screen Close Quit 1 Weak convergence and large deviation theory Large deviation principle Convergence in distribution The Bryc-Varadhan theorem Tightness and Prohorov
More informationThe Cameron-Martin-Girsanov (CMG) Theorem
The Cameron-Martin-Girsanov (CMG) Theorem There are many versions of the CMG Theorem. In some sense, there are many CMG Theorems. The first version appeared in ] in 944. Here we present a standard version,
More informationBirth and Death Processes. Birth and Death Processes. Linear Growth with Immigration. Limiting Behaviour for Birth and Death Processes
DTU Informatics 247 Stochastic Processes 6, October 27 Today: Limiting behaviour of birth and death processes Birth and death processes with absorbing states Finite state continuous time Markov chains
More informationChapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process
More informationThe Central Limit Theorem: More of the Story
The Central Limit Theorem: More of the Story Steven Janke November 2015 Steven Janke (Seminar) The Central Limit Theorem:More of the Story November 2015 1 / 33 Central Limit Theorem Theorem (Central Limit
More informationExercises. T 2T. e ita φ(t)dt.
Exercises. Set #. Construct an example of a sequence of probability measures P n on R which converge weakly to a probability measure P but so that the first moments m,n = xdp n do not converge to m = xdp.
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 information9.2 Branching random walk and branching Brownian motions
168 CHAPTER 9. SPATIALLY STRUCTURED MODELS 9.2 Branching random walk and branching Brownian motions Branching random walks and branching diffusions have a long history. A general theory of branching Markov
More informationWeak Feller Property and Invariant Measures
Weak Feller Property and Invariant Measures Martin Ondreját, J. Seidler, Z. Brzeźniak Institute of Information Theory and Automation Academy of Sciences Prague September 11, 2012 Outline 2010: Stochastic
More informationReversible Coalescing-Fragmentating Wasserstein Dynamics on the Real Line
Reversible Coalescing-Fragmentating Wasserstein Dynamics on the Real Line Vitalii Konarovskyi Leipzig university Berlin-Leipzig workshop in analysis and stochastics (017) Joint work with Max von Renesse
More informationA stochastic particle system for the Burgers equation.
A stochastic particle system for the Burgers equation. Alexei Novikov Department of Mathematics Penn State University with Gautam Iyer (Carnegie Mellon) supported by NSF Burgers equation t u t + u x u
More informationThe multidimensional Ito Integral and the multidimensional Ito Formula. Eric Mu ller June 1, 2015 Seminar on Stochastic Geometry and its applications
The multidimensional Ito Integral and the multidimensional Ito Formula Eric Mu ller June 1, 215 Seminar on Stochastic Geometry and its applications page 2 Seminar on Stochastic Geometry and its applications
More informationBayesian Methods with Monte Carlo Markov Chains II
Bayesian Methods with Monte Carlo Markov Chains II Henry Horng-Shing Lu Institute of Statistics National Chiao Tung University hslu@stat.nctu.edu.tw http://tigpbp.iis.sinica.edu.tw/courses.htm 1 Part 3
More informationReflected Brownian Motion
Chapter 6 Reflected Brownian Motion Often we encounter Diffusions in regions with boundary. If the process can reach the boundary from the interior in finite time with positive probability we need to decide
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 informationBranching Processes II: Convergence of critical branching to Feller s CSB
Chapter 4 Branching Processes II: Convergence of critical branching to Feller s CSB Figure 4.1: Feller 4.1 Birth and Death Processes 4.1.1 Linear birth and death processes Branching processes can be studied
More informationZdzislaw Brzeźniak. Department of Mathematics University of York. joint works with Mauro Mariani (Roma 1) and Gaurav Dhariwal (York)
Navier-Stokes equations with constrained L 2 energy of the solution Zdzislaw Brzeźniak Department of Mathematics University of York joint works with Mauro Mariani (Roma 1) and Gaurav Dhariwal (York) Stochastic
More informationComputer Intensive Methods in Mathematical Statistics
Computer Intensive Methods in Mathematical Statistics Department of mathematics johawes@kth.se Lecture 16 Advanced topics in computational statistics 18 May 2017 Computer Intensive Methods (1) Plan of
More informationStochastic Differential Equations.
Chapter 3 Stochastic Differential Equations. 3.1 Existence and Uniqueness. One of the ways of constructing a Diffusion process is to solve the stochastic differential equation dx(t) = σ(t, x(t)) dβ(t)
More informationEmbeddings of finite metric spaces in Euclidean space: a probabilistic view
Embeddings of finite metric spaces in Euclidean space: a probabilistic view Yuval Peres May 11, 2006 Talk based on work joint with: Assaf Naor, Oded Schramm and Scott Sheffield Definition: An invertible
More informationSTAT STOCHASTIC PROCESSES. Contents
STAT 3911 - STOCHASTIC PROCESSES ANDREW TULLOCH Contents 1. Stochastic Processes 2 2. Classification of states 2 3. Limit theorems for Markov chains 4 4. First step analysis 5 5. Branching processes 5
More informationA relative entropy characterization of the growth rate of reward in risk-sensitive control
1 / 47 A relative entropy characterization of the growth rate of reward in risk-sensitive control Venkat Anantharam EECS Department, University of California, Berkeley (joint work with Vivek Borkar, IIT
More information2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.
University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)
More informationMathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )
Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca November 26th, 2014 E. Tanré (INRIA - Team Tosca) Mathematical
More informationProof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L
Lecture 24: Defn: Topological conjugacy: Given Z + d (resp, Zd ), actions T, S a topological conjugacy from T to S is a homeomorphism φ : M N s.t. φ T = S φ i.e., φ T n = S n φ for all n Z + d (resp, Zd
More informationLAN property for sde s with additive fractional noise and continuous time observation
LAN property for sde s with additive fractional noise and continuous time observation Eulalia Nualart (Universitat Pompeu Fabra, Barcelona) joint work with Samy Tindel (Purdue University) Vlad s 6th birthday,
More informationLECTURE NOTES: Discrete time Markov Chains (2/24/03; SG)
LECTURE NOTES: Discrete time Markov Chains (2/24/03; SG) A discrete time Markov Chains is a stochastic dynamical system in which the probability of arriving in a particular state at a particular time moment
More informationThree hours THE UNIVERSITY OF MANCHESTER. 31st May :00 17:00
Three hours MATH41112 THE UNIVERSITY OF MANCHESTER ERGODIC THEORY 31st May 2016 14:00 17:00 Answer FOUR of the FIVE questions. If more than four questions are attempted, then credit will be given for the
More informationAARMS Homework Exercises
1 For the gamma distribution, AARMS Homework Exercises (a) Show that the mgf is M(t) = (1 βt) α for t < 1/β (b) Use the mgf to find the mean and variance of the gamma distribution 2 A well-known inequality
More informationUniformly Uniformly-ergodic Markov chains and BSDEs
Uniformly Uniformly-ergodic Markov chains and BSDEs Samuel N. Cohen Mathematical Institute, University of Oxford (Based on joint work with Ying Hu, Robert Elliott, Lukas Szpruch) Centre Henri Lebesgue,
More informationMA8109 Stochastic Processes in Systems Theory Autumn 2013
Norwegian University of Science and Technology Department of Mathematical Sciences MA819 Stochastic Processes in Systems Theory Autumn 213 1 MA819 Exam 23, problem 3b This is a linear equation of the form
More informationExercise 1 (Formula for connection 1-forms) Using the first structure equation, show that
1 Stokes s Theorem Let D R 2 be a connected compact smooth domain, so that D is a smooth embedded circle. Given a smooth function f : D R, define fdx dy fdxdy, D where the left-hand side is the integral
More informationA Central Limit Theorem for Fleming-Viot Particle Systems Application to the Adaptive Multilevel Splitting Algorithm
A Central Limit Theorem for Fleming-Viot Particle Systems Application to the Algorithm F. Cérou 1,2 B. Delyon 2 A. Guyader 3 M. Rousset 1,2 1 Inria Rennes Bretagne Atlantique 2 IRMAR, Université de Rennes
More informationA REVERSIBILITY PROBLEM FOR FLEMING-VIOT PROCESSES
Published in: lectronic Communications in Probability 4 1999, 65-76 A RVRSIBILITY PROBLM FOR FLMING-VIOT PROCSSS Zenghu LI 1 Department of Mathematics, Beijing Normal University Beijing 1875, P. R. CHINA
More information6. Brownian Motion. Q(A) = P [ ω : x(, ω) A )
6. Brownian Motion. stochastic process can be thought of in one of many equivalent ways. We can begin with an underlying probability space (Ω, Σ, P) and a real valued stochastic process can be defined
More informationRepresenting Gaussian Processes with Martingales
Representing Gaussian Processes with Martingales with Application to MLE of Langevin Equation Tommi Sottinen University of Vaasa Based on ongoing joint work with Lauri Viitasaari, University of Saarland
More informationRobust control and applications in economic theory
Robust control and applications in economic theory In honour of Professor Emeritus Grigoris Kalogeropoulos on the occasion of his retirement A. N. Yannacopoulos Department of Statistics AUEB 24 May 2013
More informationMalliavin Calculus in Finance
Malliavin Calculus in Finance Peter K. Friz 1 Greeks and the logarithmic derivative trick Model an underlying assent by a Markov process with values in R m with dynamics described by the SDE dx t = b(x
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 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 informationStochastic Differential Equations
CHAPTER 1 Stochastic Differential Equations Consider a stochastic process X t satisfying dx t = bt, X t,w t dt + σt, X t,w t dw t. 1.1 Question. 1 Can we obtain the existence and uniqueness theorem for
More informationBrownian Motion. 1 Definition Brownian Motion Wiener measure... 3
Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................
More informationFiltrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition
Filtrations, Markov Processes and Martingales Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition David pplebaum Probability and Statistics Department,
More informationfor all f satisfying E[ f(x) ] <.
. Let (Ω, F, P ) be a probability space and D be a sub-σ-algebra of F. An (H, H)-valued random variable X is independent of D if and only if P ({X Γ} D) = P {X Γ}P (D) for all Γ H and D D. Prove that if
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 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 informationProblems 5: Continuous Markov process and the diffusion equation
Problems 5: Continuous Markov process and the diffusion equation Roman Belavkin Middlesex University Question Give a definition of Markov stochastic process. What is a continuous Markov process? Answer:
More informationContinuous Time Markov Chains
Continuous Time Markov Chains Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 2015 Outline Introduction Continuous-Time Markov
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationStatistical test for some multistable processes
Statistical test for some multistable processes Ronan Le Guével Joint work in progress with A. Philippe Journées MAS 2014 1 Multistable processes First definition : Ferguson-Klass-LePage series Properties
More informationSimulation methods for stochastic models in chemistry
Simulation methods for stochastic models in chemistry David F. Anderson anderson@math.wisc.edu Department of Mathematics University of Wisconsin - Madison SIAM: Barcelona June 4th, 21 Overview 1. Notation
More informationIntroduction to Random Diffusions
Introduction to Random Diffusions The main reason to study random diffusions is that this class of processes combines two key features of modern probability theory. On the one hand they are semi-martingales
More informationLecture 12: Detailed balance and Eigenfunction methods
Lecture 12: Detailed balance and Eigenfunction methods Readings Recommended: Pavliotis [2014] 4.5-4.7 (eigenfunction methods and reversibility), 4.2-4.4 (explicit examples of eigenfunction methods) Gardiner
More informationBV functions in a Gelfand triple and the stochastic reflection problem on a convex set
BV functions in a Gelfand triple and the stochastic reflection problem on a convex set Xiangchan Zhu Joint work with Prof. Michael Röckner and Rongchan Zhu Xiangchan Zhu ( Joint work with Prof. Michael
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 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 informationWalsh Diffusions. Andrey Sarantsev. March 27, University of California, Santa Barbara. Andrey Sarantsev University of Washington, Seattle 1 / 1
Walsh Diffusions Andrey Sarantsev University of California, Santa Barbara March 27, 2017 Andrey Sarantsev University of Washington, Seattle 1 / 1 Walsh Brownian Motion on R d Spinning measure µ: probability
More informationConsistency of the maximum likelihood estimator for general hidden Markov models
Consistency of the maximum likelihood estimator for general hidden Markov models Jimmy Olsson Centre for Mathematical Sciences Lund University Nordstat 2012 Umeå, Sweden Collaborators Hidden Markov models
More informationMATH 217A HOMEWORK. P (A i A j ). First, the basis case. We make a union disjoint as follows: P (A B) = P (A) + P (A c B)
MATH 217A HOMEWOK EIN PEASE 1. (Chap. 1, Problem 2. (a Let (, Σ, P be a probability space and {A i, 1 i n} Σ, n 2. Prove that P A i n P (A i P (A i A j + P (A i A j A k... + ( 1 n 1 P A i n P (A i P (A
More informationMarkov Chain Approximation of Pure Jump Processes. Nikola Sandrić (joint work with Ante Mimica and René L. Schilling) University of Zagreb
Markov Chain Approximation of Pure Jump Processes Nikola Sandrić (joint work with Ante Mimica and René L. Schilling) University of Zagreb 8 th International Conference on Lévy processes Angers, July 25-29,
More informationOn some shift invariant integral operators, univariate case
ANNALES POLONICI MATHEMATICI LXI.3 1995) On some shift invariant integral operators, univariate case by George A. Anastassiou Memphis, Tenn.) and Heinz H. Gonska Duisburg) Abstract. In recent papers the
More informationEXAM IN COURSE TMA4265 STOCHASTIC PROCESSES Wednesday 7. August, 2013 Time: 9:00 13:00
Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag Page 1 of 7 English Contact: Håkon Tjelmeland 48 22 18 96 EXAM IN COURSE TMA4265 STOCHASTIC PROCESSES Wednesday 7. August, 2013
More informationin Bounded Domains Ariane Trescases CMLA, ENS Cachan
CMLA, ENS Cachan Joint work with Yan GUO, Chanwoo KIM and Daniela TONON International Conference on Nonlinear Analysis: Boundary Phenomena for Evolutionnary PDE Academia Sinica December 21, 214 Outline
More informationProperties of an infinite dimensional EDS system : the Muller s ratchet
Properties of an infinite dimensional EDS system : the Muller s ratchet LATP June 5, 2011 A ratchet source : wikipedia Plan 1 Introduction : The model of Haigh 2 3 Hypothesis (Biological) : The population
More informationReinforcement Learning: Part 3 Evolution
1 Reinforcement Learning: Part 3 Evolution Chris Watkins Department of Computer Science Royal Holloway, University of London July 27, 2015 2 Cross-entropy method for TSP Simple genetic style methods can
More informationStatistics 992 Continuous-time Markov Chains Spring 2004
Summary Continuous-time finite-state-space Markov chains are stochastic processes that are widely used to model the process of nucleotide substitution. This chapter aims to present much of the mathematics
More informationLECTURE #6 BIRTH-DEATH PROCESS
LECTURE #6 BIRTH-DEATH PROCESS 204528 Queueing Theory and Applications in Networks Assoc. Prof., Ph.D. (รศ.ดร. อน นต ผลเพ ม) Computer Engineering Department, Kasetsart University Outline 2 Birth-Death
More informationRandom measures, intersections, and applications
Random measures, intersections, and applications Ville Suomala joint work with Pablo Shmerkin University of Oulu, Finland Workshop on fractals, The Hebrew University of Jerusalem June 12th 2014 Motivation
More informationBrownian Motion on Manifold
Brownian Motion on Manifold QI FENG Purdue University feng71@purdue.edu August 31, 2014 QI FENG (Purdue University) Brownian Motion on Manifold August 31, 2014 1 / 26 Overview 1 Extrinsic construction
More information