Probabilistic Models of Population Evolution

Scaling Limits, Genealogies and Interactions

Nonfiction, Science & Nature, Mathematics, Applied, Statistics, Science
Cover of the book Probabilistic Models of Population Evolution by Étienne Pardoux, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Étienne Pardoux ISBN: 9783319303284
Publisher: Springer International Publishing Publication: June 17, 2016
Imprint: Springer Language: English
Author: Étienne Pardoux
ISBN: 9783319303284
Publisher: Springer International Publishing
Publication: June 17, 2016
Imprint: Springer
Language: English

This expository book presents the mathematical description of evolutionary models of populations subject to interactions (e.g. competition) within the population. The author includes both models of finite populations, and limiting models as the size of the population tends to infinity. The size of the population is described as a random function of time and of the initial population (the ancestors at time 0). The genealogical tree of such a population is given. Most models imply that the population is bound to go extinct in finite time. It is explained when the interaction is strong enough so that the extinction time remains finite, when the ancestral population at time 0 goes to infinity. The material could be used for teaching stochastic processes, together with their applications.

Étienne Pardoux is Professor at Aix-Marseille University, working in the field of Stochastic Analysis, stochastic partial differential equations, and probabilistic models in evolutionary biology and population genetics. He obtained his PhD in 1975 at University of Paris-Sud.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

This expository book presents the mathematical description of evolutionary models of populations subject to interactions (e.g. competition) within the population. The author includes both models of finite populations, and limiting models as the size of the population tends to infinity. The size of the population is described as a random function of time and of the initial population (the ancestors at time 0). The genealogical tree of such a population is given. Most models imply that the population is bound to go extinct in finite time. It is explained when the interaction is strong enough so that the extinction time remains finite, when the ancestral population at time 0 goes to infinity. The material could be used for teaching stochastic processes, together with their applications.

Étienne Pardoux is Professor at Aix-Marseille University, working in the field of Stochastic Analysis, stochastic partial differential equations, and probabilistic models in evolutionary biology and population genetics. He obtained his PhD in 1975 at University of Paris-Sud.

More books from Springer International Publishing

Cover of the book Italian Regionalism: Between Unitary Traditions and Federal Processes by Étienne Pardoux
Cover of the book Mapping Versatile Boundaries by Étienne Pardoux
Cover of the book Atlas of Animal Anatomy and Histology by Étienne Pardoux
Cover of the book India's Climate Change Identity by Étienne Pardoux
Cover of the book Marketing and Customer Loyalty by Étienne Pardoux
Cover of the book Bioactive Essential Oils and Cancer by Étienne Pardoux
Cover of the book Handbook of Integrated CSR Communication by Étienne Pardoux
Cover of the book Big Data Factories by Étienne Pardoux
Cover of the book Emergency Surgery Course (ESC®) Manual by Étienne Pardoux
Cover of the book Big Data in Healthcare by Étienne Pardoux
Cover of the book Actuarial Sciences and Quantitative Finance by Étienne Pardoux
Cover of the book Semantics, Pragmatics and Meaning Revisited by Étienne Pardoux
Cover of the book The Semantic Web by Étienne Pardoux
Cover of the book Polynomial Chaos Methods for Hyperbolic Partial Differential Equations by Étienne Pardoux
Cover of the book Geospatial Technologies for All by Étienne Pardoux
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy