Dissertations / Theses on the topic 'Branching processes'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Branching processes.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Harris, John William. "Branching diffusion processes." Thesis, University of Bath, 2006. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.428379.
Full textFittipaldi, María Clara. "Representation results for continuos-state branching processes and logistic branching processes." Tesis, Universidad de Chile, 2014. http://www.repositorio.uchile.cl/handle/2250/116458.
Full textEl objetivo de este trabajo es explorar el comportamiento de los procesos de rami ficación evolucionando a tiempo y estados continuos, y encontrar representaciones para su trayectoria y su genealogía. En el primer capítulo se muestra que un proceso de ramifi cación condicionado a no extinguirse es la única solución fuerte de una ecuación diferencial estocástica conducida por un movimiento Browniano y una medida puntual de Poisson, más un subordinador que representa la inmigración, dónde estos procesos son mutuamente independientes. Para esto se usa el hecho de que es posible obtener la ley del proceso condicionado a partir del proceso original, a través de su h-transformada, y se da una manera trayectorial de construir la inmigración a partir de los saltos del proceso. En el segundo capítulo se encuentra una representación para los procesos de rami ficación con crecimiento logístico, usando ecuaciones estocásticas. En particular, usando la de finición general dada por A. Lambert, se prueba que un proceso logístico es la única solución fuerte de una ecuación estocástica conducida por un movimiento Browniano y una medida puntual de Poisson, pero con un drift negativo fruto de la competencia entre individuos. En este capítulo se encuentra además una ecuación diferencial estocástica asociada con un proceso logístico condicionado a no extinguirse, suponiendo que éste existe y que puede ser de finido a través de una h-transformada. Esta representación muestra que nuevamente el condicionamiento da origen a un término correspondiente a la inmigración, pero en este caso dependiente de la población. Por último, en el tercer capítulo se obtiene una representación de tipo Ray-Knight para los procesos de ramifi cación logísticos, lo que da una descripción de su genealogía continua. Para esto, se utiliza la construcción de árboles aleatorios continuos asociados con procesos de Lévy generales dada por J.-F. Le Gall e Y. Le Jan, y una generalización del procedimiento de poda desarrollado por R. Abraham, J.-F. Delmas. Este resultado extiende la representación de Ray-Knight para procesos de difusión logísticos dada por V. Le, E. Pardoux y A. Wakolbinger.
Ku, Ho Ming. "Interacting Markov branching processes." Thesis, University of Liverpool, 2014. http://livrepository.liverpool.ac.uk/2002759/.
Full textCollins, Joseph P. "Branching processes with varying environments." Thesis, University of Bath, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607471.
Full textCole, D. J. "Stochastic branching processes in biology." Thesis, University of Kent, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270684.
Full textJanarthanan, Sivarjalingam. "Spatial spread in general branching processes." Thesis, University of Sheffield, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265577.
Full textMarguet, Aline. "Branching processes for structured populations and estimators for cell division." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX073/document.
Full textWe study structured populations without interactions from a probabilistic and a statistical point of view. The underlying motivation of this work is the understanding of cell division mechanisms and of cell aging. We use the formalism of branching measure-valued Markov processes. In our model, each individual is characterized by a trait (age, size, etc...) which moves according to a Markov process. The rate of division of each individual is a function of its trait and when a branching event occurs, the trait of the descendants at birth depends on the trait of the mother and on the number of descendants. First, we study the trait of a uniformly sampled individual in the population. We explicitly describe the penalized Markov process, named auxiliary process, corresponding to the dynamic of the trait of a "typical" individual by giving its associated infinitesimal generator. Then, we study the asymptotic behavior of the empirical measure associated with the branching process. Under assumptions assuring the ergodicity of the auxiliary process, we prove that the auxiliary process asymptotically corresponds to the trait along its ancestral lineage of a uniformly sampled individual in the population. Finally, we address the problem of parameter estimation in the case of a branching process structured by a diffusion. We consider data composed of the trait at birth of all individuals in the population until a given generation. We give kernel estimators for the transition density and the invariant measure of the chain corresponding to the trait of an individual along a lineage. Moreover, in the case of a reflected diffusion on a compact set, we use maximum likelihood estimation to reconstruct the division rate. We prove consistency and asymptotic normality for this estimator. We also carry out the numerical implementation of the estimator
Bocharov, Sergey. "Branching Lévy Processes with Inhomogeneous Breeding Potentials." Thesis, University of Bath, 2012. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571868.
Full textHautphenne, Sophie. "An algorithmic look at phase-controlled branching processes." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210255.
Full textOur objective is to develop numerical methods to answer several questions about Markovian binary trees. The issue of the extinction probability is the main question addressed in the thesis. We first assume independence between individuals. In this case, the extinction probability is the minimal nonnegative solution of a matrix fixed point equation which can generally not be solved analytically. In order to solve this equation, we develop a linear algorithm based on functional iterations, and a quadratic algorithm, based on Newton's method, and we give their probabilistic interpretation in terms of the tree.
Next, we look at some transient features for a Markovian binary tree: the distribution of the population size at any given time, of the time until extinction and of the total progeny. These distributions are obtained using the Kolmogorov and the renewal approaches.
We illustrate the results mentioned above through an example where the Markovian binary tree serves as a model for female families in different countries, for which we use real data provided by the World Health Organization website.
Finally, we analyze the case where Markovian binary trees evolve under the external influence of a random environment or a catastrophe process. In this case, individuals do not behave independently of each other anymore, and the extinction probability may no longer be expressed as the solution of a fixed point equation, which makes the analysis more complicated. We approach the extinction probability, through the study of the population size distribution, by purely numerical methods of resolution of partial differential equations, and also by probabilistic methods imposing constraints on the external process or on the maximal population size.
/
Les processus de branchements sont des processus stochastiques décrivant l'évolution de populations d'individus qui se reproduisent et meurent indépendamment les uns des autres, suivant des lois de probabilités spécifiques.
Nous considérons une classe particulière de processus de branchement, appelés arbres binaires Markoviens, dans lesquels la vie d'un individu et ses instants de reproduction sont contrôlés par un MAP. Notre objectif est de développer des méthodes numériques pour répondre à plusieurs questions à propos des arbres binaires Markoviens.
La question de la probabilité d'extinction d'un arbre binaire Markovien est la principale abordée dans la thèse. Nous faisons tout d'abord l'hypothèse d'indépendance entre individus. Dans ce cas, la probabilité d'extinction s'exprime comme la solution minimale non négative d'une équation de point fixe matricielle, qui ne peut être résolue analytiquement. Afin de résoudre cette équation, nous développons un algorithme linéaire, basé sur l'itération fonctionnelle, ainsi que des algorithmes quadratiques, basés sur la méthode de Newton, et nous donnons leur interprétation probabiliste en termes de l'arbre que l'on étudie.
Nous nous intéressons ensuite à certaines caractéristiques transitoires d'un arbre binaire Markovien: la distribution de la taille de la population à un instant donné, celle du temps jusqu'à l'extinction du processus et celle de la descendance totale. Ces distributions sont obtenues en utilisant l'approche de Kolmogorov ainsi que l'approche de renouvellement.
Nous illustrons les résultats mentionnés plus haut au travers d'un exemple où l'arbre binaire Markovien sert de modèle pour des populations féminines dans différents pays, et pour lesquelles nous utilisons des données réelles fournies par la World Health Organization.
Enfin, nous analysons le cas où les arbres binaires Markoviens évoluent sous une influence extérieure aléatoire, comme un environnement Markovien aléatoire ou un processus de catastrophes. Dans ce cas, les individus ne se comportent plus indépendamment les uns des autres, et la probabilité d'extinction ne peut plus s'exprimer comme la solution d'une équation de point fixe, ce qui rend l'analyse plus compliquée. Nous approchons la probabilité d'extinction au travers de l'étude de la distribution de la taille de la population, à la fois par des méthodes purement numériques de résolution d'équations aux dérivées partielles, ainsi que par des méthodes probabilistes en imposant des contraintes sur le processus extérieur ou sur la taille maximale de la population.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Wang, Ying. "Branching Processes: Optimization, Variational Characterization, and Continuous Approximation." Doctoral thesis, Universitätsbibliothek Leipzig, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-62048.
Full textRagab, Mahmoud [Verfasser]. "Partial Quicksort and weighted branching processes / Mahmoud Ragab." Kiel : Universitätsbibliothek Kiel, 2011. http://d-nb.info/1020244569/34.
Full textJones, Owen Dafydd. "Random walks on pre-fractals and branching processes." Thesis, University of Cambridge, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388440.
Full textPenington, Sarah. "Branching processes with spatial structure in population models." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:361e5c58-e6dd-47a0-9a52-303e897547e8.
Full textWu, Yadong Carleton University Dissertation Mathematics. "Dynamic particle systems and multilevel measure branching processes." Ottawa, 1991.
Find full textNicholson, Michael David. "Applications of branching processes to cancer evolution and initiation." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/33034.
Full textKielisch, Fridolin Wilhelm [Verfasser]. "Lookdown-Constructions of Symbiotic Branching Processes / Fridolin Wilhelm Kielisch." Mainz : Universitätsbibliothek Mainz, 2020. http://d-nb.info/1204596611/34.
Full textCheng, Tak Sum. "Stochastic optimal control in randomly-branching environments." HKBU Institutional Repository, 2006. http://repository.hkbu.edu.hk/etd_ra/713.
Full textJang, Sa-Han. "An analytical and numerical study of Galton-Watson branching processes relevant to population dynamics." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 425 p, 2007. http://proquest.umi.com/pqdweb?did=1362537711&sid=18&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full textPénisson, Sophie. "Continuous-time multitype branching processes conditioned on very late extinction." Universität Potsdam, 2009. http://opus.kobv.de/ubp/volltexte/2011/4954/.
Full textAlstott, Jeffrey Daniel. "The behaviour and utility of branching processes on complex networks." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708131.
Full textNikopoulos, George N. "NRAGE in Branching Morphogenesis of the Developing Murine Kidney." Fogler Library, University of Maine, 2009. http://www.library.umaine.edu/theses/pdf/NikopoulosG2009.pdf.
Full textHermann, Felix [Verfasser], and Peter [Akademischer Betreuer] Pfaffelhuber. "On dualities of random graphs and branching processes with disasters to Piecewise deterministic Markov processes." Freiburg : Universität, 2019. http://d-nb.info/1182225985/34.
Full textHartung, Lisa Bärbel [Verfasser]. "Extremal Processes in Branching Brownian Motion and Friends / Lisa Bärbel Hartung." Bonn : Universitäts- und Landesbibliothek Bonn, 2016. http://d-nb.info/1113688432/34.
Full textMurphy, Philip. "Nonrelativistic quark model calculation of the K-P --> [Lambda gamma] and K-P --> [Sigma]0[gamma] branching ratios." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/30167.
Full textScience, Faculty of
Physics and Astronomy, Department of
Graduate
Pénisson, Sophie. "Conditional limit theorems for multitype branching processes and illustration in epidemiological risk analysis." Phd thesis, Université Paris Sud - Paris XI, 2010. http://tel.archives-ouvertes.fr/tel-00570458.
Full textNordvall, Lagerås Andreas. "Markov Chains, Renewal, Branching and Coalescent Processes : Four Topics in Probability Theory." Doctoral thesis, Stockholm University, Department of Mathematics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-6637.
Full textThis thesis consists of four papers.
In paper 1, we prove central limit theorems for Markov chains under (local) contraction conditions. As a corollary we obtain a central limit theorem for Markov chains associated with iterated function systems with contractive maps and place-dependent Dini-continuous probabilities.
In paper 2, properties of inverse subordinators are investigated, in particular similarities with renewal processes. The main tool is a theorem on processes that are both renewal and Cox processes.
In paper 3, distributional properties of supercritical and especially immortal branching processes are derived. The marginal distributions of immortal branching processes are found to be compound geometric.
In paper 4, a description of a dynamic population model is presented, such that samples from the population have genealogies as given by a Lambda-coalescent with mutations. Depending on whether the sample is grouped according to litters or families, the sampling distribution is either regenerative or non-regenerative.
Nordvall, Lagerås Andreas. "Markov chains, renewal, branching and coalescent processes : four topics in probability theory /." Stockholm : Department of Mathematics, Stockholm university, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-6637.
Full textPlazzotta, Giacomo. "Linking tree shapes to the spread of infection using generalised branching processes." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/44829.
Full textBlauth, Jérôme [Verfasser]. "Infinite rate mutually catalytic branching driven by alpha-stable Lévy processes / Jérôme Blauth." Mainz : Universitätsbibliothek Mainz, 2017. http://d-nb.info/1125910283/34.
Full textGlöde, Patric Karl [Verfasser], and Andreas [Akademischer Betreuer] Greven. "Dynamics of Genealogical Trees for Autocatalytic Branching Processes / Patric Karl Glöde. Betreuer: Andreas Greven." Erlangen : Universitätsbibliothek der Universität Erlangen-Nürnberg, 2013. http://d-nb.info/1033029912/34.
Full textHammer, Matthias [Verfasser]. "Ergodicity and regularity of invariant measure for branching Markov processes with immigration / Matthias Hammer." Mainz : Universitätsbibliothek Mainz, 2012. http://d-nb.info/1029390975/34.
Full textGlöde, Patric [Verfasser], and Andreas [Akademischer Betreuer] Greven. "Dynamics of Genealogical Trees for Autocatalytic Branching Processes / Patric Karl Glöde. Betreuer: Andreas Greven." Erlangen : Universitätsbibliothek der Universität Erlangen-Nürnberg, 2013. http://nbn-resolving.de/urn:nbn:de:bvb:29-opus-45453.
Full textCyran, Krzysztof. "Artifical intelligence, branching processes and coalescent methods in evolution of humans and early life." Praca habilitacyjna, Wydawnictwo Politechniki Śląskiej, 2011. https://delibra.bg.polsl.pl/dlibra/docmetadata?showContent=true&id=13205.
Full textBansaye, Vincent. "Applications des processus de Lévy et processus de branchement à des études motivées par l'informatique et la biologie." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2008. http://tel.archives-ouvertes.fr/tel-00339230.
Full textDávila-Felipe, Miraine. "Pathwise decompositions of Lévy processes : applications to epidemiological modeling." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066651.
Full textThis dissertation is devoted to the study of some pathwise decompositions of spectrally positive Lévy processes, and duality relationships for certain (possibly non-Markovian) branching processes, driven by the use of the latter as probabilistic models of epidemiological dynamics. More precisely, we model the transmission tree of a disease as a splitting tree, i.e. individuals evolve independently from one another, have i.i.d. lifetimes (periods of infectiousness) that are not necessarily exponential, and give birth (secondary infections) at a constant rate during their lifetime. The incidence of the disease under this model is a Crump-Mode-Jagers process (CMJ); the overarching goal of the two first chapters is to characterize the law of this incidence process through time, jointly with the partially observed (inferred from sequence data) transmission tree. In Chapter I we obtain a description, in terms of probability generating functions, of the conditional likelihood of the number of infectious individuals at multiple times, given the transmission network linking individuals that are currently infected. In the second chapter, a more elegant version of this characterization is given, passing by a general result of invariance under time reversal for a class of branching processes. Finally, in Chapter III we are interested in the law of the (sub)critical branching process seen from its extinction time. We obtain a duality result that implies in particular the invariance under time reversal from their extinction time of the (sub)critical CMJ processes and the excursion away from 0 of the critical Feller diffusion (the width process of the continuum random tree)
Hartfield, Matthew. "Evolution of sex and recombination in large, finite populations." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/6212.
Full textSamuelsson, Love. "Introducing DevOps methods and processes for an existing organization." Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-107150.
Full textChampagnat, Nicolas, and Sylvie Roelly. "Limit theorems for conditioned multitype Dawson-Watanabe processes and Feller diffusions." Universität Potsdam, 2008. http://opus.kobv.de/ubp/volltexte/2008/1861/.
Full textAdam, Etienne. "Persistance et vitesse d'extinction pour des modèles de populations stochastiques multitypes en temps discret." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLX019/document.
Full textThis thesis is devoted to the mathematical study of stochastic modelds of structured populations dynamics.In the first chapter, we introduce a discrete time stochastic process taking into account various ecological interactions between individuals, such as competition, migration, mutation, or predation. We first prove a ``law of large numbers'': where we show that if the initial population tends to infinity, then, on any finite interval of time, the stochastic process converges in probability to an underlying deterministic process. We also quantify the discrepancy between these two processes by a kind of ``central limit theorem''. Finally, we give a criterion of persistence/extinction in order to determine the long time behavior of the process. This criterion highlights a critical case which will be studied in more detail in the following chapters.In the second chapter, we give a criterion for the possible unlimited growth in the critical case mentioned above. We apply this criterion to the example of a source-sink metapopulation with two patches of type source, textit{i.e.} the population of each patch goes to extinction if we do not take into account the migration. We prove that there is a possible survival of the metapopulation.In the third chapter, we focus on the behavior of our critical process when it tends to infinity. We prove a convergence in distribution of the scaled process to a gamma distribution, and in a more general framework, by also rescaling time, we obtain a distribution limit of a function of our process to the solution of a stochastic differential equation called a squared Bessel process.In the fourth and last chapter, we study hitting times of some compact sets when our process does not tend to infinity. We give nearly optimal bounds for the tail of these hitting times. If the process goes to extinction almost surely, we deduce from these bounds precise estimates of the tail of the extinction time. Moreover, if the process is a Markov chain, we give a criterion of null recurrence or positive recurrence and in the latter case, we obtain a subgeometric convergence of its transition kernel to its invariant probability measure
Sinkovic, John Henry. "The Relationship Between the Minimal Rank of a Tree and the Rank-Spreads of the Vertices and Edges." Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1622.pdf.
Full textHenry, Benoit. "Processus de branchements non Markoviens en dynamique et génétique des populations." Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0135/document.
Full textIn this thesis we consider a general branching population. The lifetimes of the individuals are supposed to be i.i.d. random variables distributed according to an arbitrary distribution. Moreover, each individual gives birth to new individuals at Poisson rate independently from the other individuals. The tree underlying the dynamics of this population is called a splitting tree. The process which count the number of alive individuals at given times is known as binary homogeneous Crump-Mode-Jagers processes. Such processes are known, when properly renormalized, to converge almost surely to some random variable. Thanks to the study of the underlying splitting tree through the tools introduced by A. Lambert in 2010, we show a central limit theorem associated to this a.s. convergence. Moreover, we suppose that individuals undergo mutation at Poisson rate under the infinitely many alleles assumption. We are mainly interested in the so called allelic frequency spectrum which describes the frequency of sizes of families (i.e. sets of individuals carrying the same type) at fixed times. Thanks to the methods developedin this thesis, we are able to get approximation results for the frequency spectrum. In a last part, we study some statistical problems for size constrained Galton-Watson trees. Our goal is to estimate the variance of the birth distribution. Using that the contour process of such tree converges to a Brownian excursion as the size of the tree growth, we construct estimators of the variance of the birth distribution
Smadi, Charline. "Modèles probabilistes de populations : branchement avec catastrophes et signature génétique de la sélection." Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1035/document.
Full textThis thesis is devoted to the probabilistic study of demographic and genetical responses of a population to some point wise events. In a first part, we are interested in the effect of random catastrophes, which kill a fraction of the population and occur repeatedly, in populations modeled by branching processes. First we construct a new class of processes, the continuous state branching processes with catastrophes, as the unique strong solution of a stochastic differential equation. Then we describe the conditions for the population extinction. Finally, in the case of almost sure absorption, we state the asymptotical rate of absorption. This last result has a direct application to the determination of the number of infected cells in a model of cell infection by parasites. Indeed, the parasite population size in a lineage follows in this model a branching process, and catastrophes correspond to the sharing of the parasites between the two daughter cells when a division occurs. In a second part, we focus on the genetic signature of selective sweeps. The genetic material of an individual (mostly) determines its phenotype and in particular some quantitative traits, as birth and intrinsic death rates, and interactions with others individuals. But genotype is not sufficient to determine "adaptation" in a given environment: for example the life expectancy of a human being is very dependent on his environment (access to drinking water, to medical infrastructures,...). The eco-evolutive approach aims at taking into account the environment by modeling interactions between individuals. When a mutation or an environmental modification occurs, some alleles can invade the population to the detriment of other alleles: this phenomenon is called a selective sweep and leaves signatures in the neutral diversity in the vicinity of the locus where the allele fixates. Indeed, this latter "hitchhiking” alleles situated on loci linked to the selected locus. The only possibility for an allele to escape this "hitchhiking" is the occurrence of a genetical recombination, which associates it to another haplotype in the population. We quantify the signature left by such a selective sweep on the neutral diversity. We first focus on neutral proportion variation in loci partially linked with the selected locus, under different scenari of selective sweeps. We prove that these different scenari leave distinct signatures on neutral diversity, which can allow to discriminate them. Then we focus on the linked genealogies of two neutral alleles situated in the vicinity of the selected locus. In particular, we quantify some statistics under different scenari of selective sweeps, which are currently used to detect recent selective events in current population genetic data. In these works the population evolves as a multitype birth and death process with competition. If such a model is more realistic than branching processes, the non-linearity caused by competitions makes its study more complex
Hénard, Olivier. "Généalogie et Q-processus." Phd thesis, Université Paris-Est, 2012. http://tel.archives-ouvertes.fr/tel-00763378.
Full textJones, Cameron Lawrence, and cajones@swin edu au. "Image analysis of fungal biostructure by fractal and wavelet techniques." Swinburne University of Technology, 1997. http://adt.lib.swin.edu.au./public/adt-VSWT20051107.093036.
Full textMazoyer, Adrien. "Modèles de mutation : étude probabiliste et estimation paramétrique." Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAM032/document.
Full textMutation models are probabilistic descriptions of the growth of a population of cells, where mutationsoccur randomly during the process. Data are samples of integers, interpreted as final numbers ofmutant cells. These numbers may be coupled with final numbers of cells (mutant and non mutant) or a mean final number of cells.The frequent appearance in the data of very large mutant counts, usually called “jackpots”, evidencesheavy-tailed probability distributions.Any mutation model can be interpreted as the result of three ingredients. The first ingredient is about the number of mutations occuring with small probabilityamong a large number of cell divisions. Due to the law of small numbers, the number of mutations approximately follows aPoisson distribution. The second ingredient models the developing duration of the clone stemming from each mutation. Due to exponentialgrowth, most mutations occur close to the end of the experiment. Thus the developing time of arandom clone has exponential distribution. The last ingredients represents the number of mutant cells that any clone developing for a given time will produce. Thedistribution of this number depends mainly on the distribution of division times of mutants.One of the most used mutation model is the Luria-Delbrück model.In these model, division times of mutant cells were supposed to be exponentially distributed.Thus a clone develops according to a Yule process and its size at any given time follows a geometric distribution.This approach leads to a family of probability distributions which depend on the expected number of mutations and the relative fitness, which is the ratio between the growth rate of normal cells to that of mutants.The statistic purpose of these models is the estimation of these parameters. The probability for amutant cell to appear upon any given cell division is estimated dividing the mean number of mutations by the mean final number of cells.Given samples of final mutant counts, it is possible to build estimators maximizing the likelihood, or usingprobability generating function.Computing robust estimates is of crucial importance in medical applications, like cancer tumor relapse or multidrug resistance of Mycobacterium Tuberculosis for instance.The problem with classical mutation models, is that they are based on quite unrealistic assumptions: constant final number of cells,no cell deaths, exponential distribution of lifetimes, or time homogeneity. Using a model for estimation, when thedata have been generated by another one, necessarily induces a bias on estimates.Several sources of bias has been partially dealed until now: non-exponential lifetimes, cell deaths, fluctuations of the final count of cells,dependence of the lifetimes, plating efficiency. The time homogeneity remains untreated.This thesis contains probabilistic and statistic study of mutation models taking into account the following bias sources:non-exponential and non-identical lifetimes, cell deaths, fluctuations of the final count of cells, plating efficiency.Simulation studies has been performed in order to propose robust estimation methods, whatever the modeling assumptions.The methods have also been applied to real data sets, to compare the results with the estimates obtained under classical models.An R package based on the different results obtained in this work has been implemented (joint work with Rémy Drouilhetand Stéphane Despréaux) and is available on the CRAN. It includes functions dedicated to the mutation models and parameter estimation.The applications have been developed for the Labex TOUCAN (Toulouse Cancer)
Castro, Diogo [UNIFESP]. "Simulação computacional e análise de um modelo fenotípico de evolução viral." Universidade Federal de São Paulo (UNIFESP), 2011. http://repositorio.unifesp.br/handle/11600/10085.
Full textUma grande quantidade dos vírus de importância médica, como o HIV, o vírus sincicial respiratório, o vírus da hepatite C, o vírus influenza A (H1N1), e o vírus da poliomielite, possui genoma RNA. Estes vírus apresentam taxas mutacionais extremamente altas, rápida cinética replicativa, população numerosa de partículas, e grande diversidade genética. Manifestas durante o processo infeccioso, tais características permitem a população viral adaptar-se rapidamente a ambientes dinâmicos, escapar ao sistema imunológico, desenvolver resistência às vacinas e drogas antivirais, e exibir dinâmica evolutiva complexa cuja compreensão representa um desafio para a genética de populações tradicional e para as estratégias de intervenção terapêutica efetiva. Para descrever biológica e matematicamente a evolução dos vírus RNA, modelos teóricos de evolução viral têm sido propostos, e muitas de suas predições foram confirmadas experimentalmente. O presente trabalho teve como objetivo simular computacionalmente e analisar um modelo de evolução viral que represente relações evolutivas existentes entre a população viral de genoma RNA e as diferentes pressões seletivas exercidas sobre ela na sua interação com o organismo hospedeiro. Também objetivou desenvolver um software de simulação computacional personalizado para o modelo de evolução viral, e demonstrar a possibilidade de descrever o modelo como um processo de ramificação de Galton-Watson. Entre os resultados e discussões delineados, encontram-se um critério analítico para estudo do tempo de recuperação e do regime crítico de um processo de ramificação de Galton-Watson aplicado à evolução viral; predições sobre a correlação entre fatores do organismo hospedeiro e a dinâmica evolutiva da população viral; predições sobre a contribuição da taxa mutacional, do tamanho e da capacidade replicativa máxima da população viral para o prognóstico e quatro fases da infecção: o tempo de recuperação, o equilíbrio mutação-seleção, o limiar da extinção, e a mutagênese letal.
A large amount of viruses of medical importance such as HIV, respiratory syncytial virus, the hepatitis C virus, influenza A (H1N1) and polio virus, has RNA genome. These viruses exhibit extremely high mutational rate, fast replicative kinetics, large population of particles and high genetic diversity. Manifested during the infectious process, these features allow the virus population to adapt quickly to dynamic environments, escape from the immune system, develop resistance to vaccines and antiviral drugs, and display complex evolutionary dynamics whose understanding represents a challenge to the traditional population genetics and for effective therapeutic intervention strategies. To describe mathematically and biological evolution of RNA viruses, theoretical models of virus evolution have been proposed, and many of their predictions were experimentally confirmed. This study aimed to simulate and analyze computationally a model of viral evolution that represents evolutionary relationships between the population of viral RNA genome and the different selective pressures on it in its interaction with the host organism. It also aimed to develop computational simulation software for the viral evolution model, and demonstrate the possibility of describing the model as a Galton-Watson branching process. Among the results and discussions outlined, there are an analytical criterion to study the recovery time and the critical regime of a Galton-Watson branching process applied to viral evolution; predictions about the correlation between factors of the host organism and the evolutionary dynamics of viral population; predictions about the contribution of mutational rate, the size and maximum replicative capacity of viral population for the prognosis and four stages of infection: recovery time, mutation-selection equilibrium, extinction threshold, and lethal mutagenesis.
TEDE
BV UNIFESP: Teses e dissertações
García, García Beatriz. "Estudio de procesos de Migración y Plasticidad en el Sistema Nervioso Central: Papel de Semaforina 4F y kinasa de adhesión focal (FAK)." Doctoral thesis, Universitat de Barcelona, 2013. http://hdl.handle.net/10803/116772.
Full textThis thesis presents several results related to important processes regarding neural circuit formation, i.e. migration and ramification of Central Nervous System (CNS) cells. First, we have determined the expression of transmembrane semaphorin 4F (Sema4F) in developing and adult mice brain. Expression of this protein is high in neuronal and oligodendrocyte precursor cells (OPCs), and in different areas including optic nerve (ON) and different migratory pathways. In vitro experiments confirmed Sema4F expression in OPCs. We investigated the role of this protein in functions important for OPC physiology, and found that Sema4F inhibits OPC migration from ON explants and induces their differentiation into mature progenitors. Negative effects of Sema4F in migration must involve cytoskeleton changes. Focal adhesion kinase (FAK) is an important integrator of different extracellular signals and modulates cytoskeleton dynamics to control generation of lamellipodia, fillopodia and stress fibers. In the present project we found that Sema4F is able to phosphorylate FAK, and that FAK enhances OPC migration. The exact implications of Sema4F-FAK relationship remain to be elucidated. FAK exists in different spliced isoforms, expressed preferentially in brain. In this project, we characterised the exact isoform expressed in different areas of the brain and by different cell types. Finally, FAK response to neurotrophins is well characterised. FAK also participates in ramification processes, with controversial final effects in neurons. Ack1 is a crucial transducer of neurotrophin-induced ramification. In this thesis we show that both proteins interact specifically in neurons. We have also found that the activation of FAK is necessary for Ack1 phosphorylation upon stimulation, and viceversa. FAK mediates netrin-1 attraction, and here we have determined that knocking-down Ack1 avoids netrin-1 effects in hippocampal explants. By Mass Spectrometry (MS) techniques, we have observed changes in the phosphorylation state of both proteins depending on the developmental stage of the brain (P5 mice) or its activation state (epileptic mice).
Hoffmann, Daniel [Verfasser], Frank [Akademischer Betreuer] Seifried, Frank [Gutachter] Seifried, Volker [Gutachter] Schulz, and Sören [Gutachter] Christensen. "Stochastic Particle Systems and Optimization - Branching Processes, Mean Field Games and Impulse Control / Daniel Hoffmann ; Gutachter: Frank Seifried, Volker Schulz, Sören Christensen ; Betreuer: Frank Seifried." Trier : Universität Trier, 2020. http://d-nb.info/1221825690/34.
Full textCao, Xiaoou. "Growth of Galton-Watson trees with lifetimes, immigrations and mutations." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:beaa9fe1-d60c-4487-9520-e8f004b53e6f.
Full textDriver, David Philip. "An optimisation-based approach to FKPP-type equations." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/277769.
Full text