Convergence of a Moran model to Eigen s quasispecies model
|
|
- Rosemary Hart
- 5 years ago
- Views:
Transcription
1 Convergence of a Moran odel to Eigen s quasispecies odel Joseba Dalau Université Paris Sud and ENS Paris June 6, 2018 arxiv: v1 [q-bio.pe] 8 Apr 2014 Abstract We prove that a Moran odel converges in probability to Eigen s quasispecies odel in the infinite population liit. 1 Introduction The concept of quasispecies was proposed by Manfred Eigen in order to explain how a population of acroolecules behaves when subject to an evolutionary process with selection and utation. In his celebrated paper [8], Eigen odels the evolution of a population of acroolecules via a syste of differential equations, which arises fro the laws of cheical kinetics. Selection is perfored according to a fitness landscape, and utations occur in the course of reproductions, independently at each locus with rate q. On the sharp peak landscape all but one sequence, the aster sequence, have the sae fitness and the aster sequence has higher fitness than the rest Eigen discovered that an error threshold phenoenon takes place: there exists a critical utation rate q such that if q > q then at equilibriu the population is totally rando, while if q < q then at equilibriu the population fors a quasispecies, i.e., it contains a positive fraction of the aster sequence along with a cloud of utants that closely reseble the aster sequence. The concepts of error threshold and quasispecies ight not only be relevant in olecular genetics, but also in several other areas of biology, naely population genetics or virology [7]. Nevertheless, in Eigen s odel the dynaics of the concentrations of the different genotypes is driven by a syste of differential equations, which is a ajor drawback for the viability of the odel in settings ore coplex than the olecular level [18]. A finite and stochastic version of Eigen s quasispecies odel would be uch ore suitable to expand the quasispecies theory to other areas [9, 16, 18]. 1
2 The issue of designing a finite population version of the quasispecies odel has been tackled by several authors. Different approaches have been considered in the literature: Alves and Fontanari [1] propose a finite population odel and they study the dependence of the error threshold on the population size, a siilar approach is taken by McCaskill [11], Park, Muñoz, Dee [14] and Saakian, Dee, Hu [15], who all suggest different kinds of finite population odels. In [13], Nowak and Schuster derive the error threshold for finite populations using a birth and death chain. More recently, in [2, 3], Cerf shows that the error threshold and quasispecies concepts arise for both the Moran odel and the classical Wright Fisher odel in the appropriate asyptotic regies. Soe other authors propose stochastic odels that converge to Eigen s odel in the infinite population liit, this is the approach taken by Deetrius, Schuster, Sigund [5], who use branching processes, Dixit, Srivastava, Vishnoi [6] or Musso [12]. Showing convergence of a finite population odel to Eigen s odel is in general a delicate atter; to our knowledge, all the works that have been done in this direction prove that soe stochastic process converges to Eigen s odel in expectation. As pointed out in [5], convergence in expectation can be isleading soeties, ainly due to the fact that variation ight increase as expectation converges, leading to a poor understanding of the asyptotic behaviour of the stochastic process. In the current work we consider the Moran odel studied in [2, 4] driving the evolution of a finite population subject to selection and utation effects. This Moran odel is shown to converge to Eigen s quasispecies odel in the infinite population liit, independently of the fitness landscape: on any finite tie interval, we prove convergence in probability for the supreu nor. The interest of our result not only lies on the type of convergence, but also on the choice of the odel: the Moran odel is possibly one of the siplest odels for which such a result can be expected. The result is proven by eans of a theore due to Kurtz [10], which gives sufficient conditions for the convergence of a sequence of Markov processes to a deterinistic trajectory, characterised by a syste of differential equations. The article is organised as follows: first we briefly introduce Eigen s quasispecies odel and the Moran odel. We state the ain result in section 3. In section 4 we adapt Kurtz s theore, which originally deals with continuous state space Markov chains, to the discrete state space setting. Finally, in section 5, we apply Kurtz s theore in order to prove the ain result. 2
3 2 The Eigen and Moran odels We present here Eigen s quasispecies odel and a discrete Moran odel. Consider a set of N different genotypes, labelled fro 1 to N. Both Eigen s odel and the Moran odel describe the evolution of a population of individuals having genotypes 1,...,N. In both odels the evolution of the population is driven by two ain forces: selection and utation. The selection and utation echaniss depend only on the genotypes, and are coon to both odels. Selection is perfored with a fitness landscape (f i ) 1 i N, f i being the reproduction rate of an individual having genotype i. The utation schee is encoded in a utation atrix(q ij ) 1 i,j N, Q ij being the probability that an individual having genotype i utates into an individual having genotype j. The utation atrix is assued to be stochastic, i.e., its entries are non negative and the rows add up to 1. Eigen s odel. Eigen originally forulated the quasispecies odel to explain the evolution of a population of acroolecules. The evolution of the concentration of the different genotypes is driven by a syste of differential equations, obtained fro the theory of cheical kinetics. Let us denote by S N the unit siplex, i.e., S N = {x R N : x i 0, 1 i N and x 1 + +x N = 1}. An eleent x S N represents a population in which the concentration of the individuals having the i th genotype is x i, for 1 i N. Let x 0 S N be the starting population and let us denote by x(t) the population at tie t > 0. Eigen s odel describes the dynaics of x(t) thorough the following syste of differential equations: ( ) x i(t) = N N f k Q ki x k (t) x i (t) f k x k (t), 1 i N, k=1 k=1 with initial condition x(0) = x 0. The first ter in the differential equation accounts for the replication rate and utations towards the i th genotype, while the second ter helps to keep the total concentration constant. A recent review on Eigen s quasispecies odel can be found in [17]. The Moran odel. Moran odels ai at describing the evolution of a finite population. The dynaics of the population is stochastic, the evolution is described by a Markov chain. Loosely speaking, the Moran odel evolves as follows: at each step of tie, an individual is selected fro the current 3
4 population according to its fitness, this individual then produces an offspring, which is subject to utations. Finally, an individual chosen uniforly at rando fro the population is replaced by the offspring. The state space of the Moran process will be the set PN of the ordered partitions of the integer in at ost N parts: P N = {z N N : z 1 + +z N = }. An eleent z P N represents a population in which z i individuals have the genotype i, for 1 i N. The only allowed changes at each tie step consist in replacing an individual fro the current population by a new one. If we denote by (e i ) 1 i N the canonical basis of R N, the only allowed changes in a population are of the for z z e i +e j 1 i,j N. Let λ be a constant such that λ ax{f i : 1 i N }. The Moran process is the Markov chain (Z n ) n 0 having state space PN and transition atrix p given by: for all z Pl+1 and i,j {1,...,N } such that i j, p(z,z e i +e j ) = z i 1 N f k Q kj z k. λ The other non diagonal coefficients of the transition atrix are null, the diagonal coefficients are arranged so that the atrix is stochastic, i.e., the entries are non negative and the rows add up to 1. k=1 3 Main result Our ai is to show that Eigen s quasispecies odel arises as the infinite population liit of the Moran odel. More precisely, we will prove the following result: Theore 3.1. Let (Z n ) n 0 be the Moran process described above. Suppose that we have the convergence of the initial conditions towards x 0 : 1 li Z 0 = x 0, and let x(t) be the solution of the syste of differential equations ( ) with initial condition x(0) = x 0. Then, for every δ,t > 0, we have ( li P sup 0 t T ) 1 Z λt x(t) > δ = 0. 4
5 This result is an iediate consequence of theore 4.7 in [10]. In order to prove the result, we proceed in two steps. We state first theore 4.7 in [10], and we show next that all the hypotheses needed to apply the theore are fulfilled in our particular setting. 4 Convergence of a faily of Markov chains Let d 1 and let E be a subset of R d. Let ( (X n ) n 0, 1 ) be a sequence of discrete tie Markov chains with state spaces E E and transition atrices (p (x,y)) x,y E. Let F : R d R d and consider the syste of differential equations x i (t) = F i(x(t)), 1 i N. Theore 4.7 in [10] gives a series of sufficient conditions under which the sequence of Markov chains (X ) 1 converges to a solution of the above syste of differential equations. The original stateent of theore 4.7 in [10] is written for the ore general setting of continuous state space Markov chains. We odify just the notation in [10] in order to state the result in a way which is ore suited to our particular setting. Theore 4.7 in [10] can be applied if the following set of conditions is satisfied. There exist sequences of positive nubers (α ) 1 and (ε ) 1 such that 1. li α = and li ε = sup sup α y x p (x,y) <. 1 x E y E 3. li sup α y x p (x,y) = 0. x E y E : y x >ε Define, for 1, F (x) = α (y x)p (x,y). y E 4. li sup x E F (x) F(x) = There exists a constant M such that x,y E, F(x) F(y) M x y. 5
6 Theore 4.1 (Kurtz). Suppose that conditions 1 5 are satisfied. Suppose further that we have the convergence of the initial conditions Then, for every δ,t > 0, we have ( li P sup 0 t T li X 0 = x0. X αt x(t) ) > δ = 0. 5 Proof of theore 3.1 Let (Z n ) n 0 be the Moran process defined in section 2. Our ai is to apply theore 4.1 to the sequence of Markov chains ( (Z n /) n 0, 1 ). We only need to find the appropriate sequences (α ) 1 and (ε ) 1 and verify that conditions 1 5 are satisfied in our setting. For 1, let α = λ and ε = 2/. The sequences (α ) 1 and(ε ) 1 obviously verify condition 1. As for condition 2, we have, for z P N z z p(z,z ) = z P N N e i + e j p(z,z e i +e j ) i,j=1 2. Thus, sup 1 sup z P N α z P N z z p(z,z ) λ 2 <, as required for condition 2. Since p(z,z ) > 0 if and only if z z 2, for all 1 and z PN, we have z P N : z z >ε z z p(z,z ) = 0, and condition 3 is also satisfied. Let F : R N R N be the function defined by i {1,...,N }, x R N, F i (x) = N N f j Q ji x j x i f j x j. j=1 j=1 6
7 Since all the partial derivatives of F are bounded on the siplex S N, F is a Lipschitz function on S N, i.e., condition 5 holds. Finally, let us copute, for 1 and x P N /, the value of F (x). By definition, F (x) = λ z P N ( z x ) p(x,z) = λ Thus, for i {1,...,N } we have N ( e i +e j )p(x,x e i +e j ). i,j=1 Fi (x) = λ p(x,x e k +e i ) λ i +e k ) k:k i k:k ip(x,x e = N x k f j Q ji x j N x i f j Q jk x j. k:k i j=1 k:k i j=1 Since x 1 + +x N = 1 and for all i {1,...,N }, Q i1 + +Q in = 1, F i (x) = (1 x i ) N N f j Q ji x j x i f j (1 Q ji )x j = j=1 j=1 N N f j Q ji x j x i f j x j. j=1 j=1 Thus, the function F coincides with the function F on the set P N /, which readily iplies condition 4. Since all five conditions are satisfied, we can apply theore 4.1 to the sequence of Markov chains ( (Z n /) n 0, 1 ) and we obtain the desired result. References [1] Doingos Alves and Jose Fernando Fontanari. Error threshold in finite populations. Phys. Rev. E, 57: , [2] Raphaël Cerf. Critical population and error threshold on the sharp peak landscape for a Moran odel. preprint, [3] Raphaël Cerf. Critical population and error threshold on the sharp peak landscape for the Wright Fisher odel. preprint, [4] Raphaël Cerf and Joseba Dalau. The distribution of the quasispecies for a Moran odel on the sharp peak landscape. preprint, [5] Lloyd Deetrius, Peter Schuster, and Karl Sigund. Polynucleotide evolution and branching processes. Bulletin of Matheatical Biology, 47(2): ,
8 [6] Narendra M. Dixit, Piyush Srivastava, and Nisheeth K. Vishnoi. A finite population odel of olecular evolution: theory and coputation. J. Coput. Biol., 19(10): , [7] Esteban Doingo. Quasispecies theory in virology. Journal of Virology, 76(1): , [8] Manfred Eigen. Self-organization of atter and the evolution of biological acroolecules. Naturwissenschaften, 58(10): , [9] Manfred Eigen, John McCaskill, and Peter Schuster. The olecular quasi-species. Advances in Cheical Physics, 75: , [10] Thoas G. Kurtz. Solutions of ordinary differential equations as liits of pure jup Markov processes. J. Appl. Probability, 7:49 58, [11] John McCaskill. A stochastic theory of acroolecular evolution. Biological Cybernetics, 50:63 73, [12] Fabio Musso. A stochastic version of the Eigen odel. Bull. Math. Biol., 73(1): , [13] Martin A. Nowak and Peter Schuster. Error thresholds of replication in finite populations. Mutation frequencies and the onset of Muller s ratchet. Journal of theoretical Biology, 137 (4): , [14] Jeong-Man Park, Enrique Muñoz, and Michael W. Dee. Quasispecies theory for finite populations. Phys. Rev. E, 81:011902, [15] David B. Saakian, Michael W. Dee, and Chin-Kun Hu. Finite population size effects in quasispecies odels with single-peak fitness landscape. Europhysics Letters, 98(1):18001, [16] Peter Schuster. Matheatical odeling of evolution. Solved and open probles. Theory Biosci., 130:71 89, [17] Peter Schuster. The atheatics of Darwin s theory of evolution: 1859 and 150 years later. In The atheatics of Darwin s legacy, Math. Biosci. Interact., pages Birkhäuser/Springer Basel AG, Basel, [18] Claus Wilke. Quasispecies theory in the context of population genetics. BMC Evolutionary Biology, 5:1 8,
On Lotka-Volterra Evolution Law
Advanced Studies in Biology, Vol. 3, 0, no. 4, 6 67 On Lota-Volterra Evolution Law Farruh Muhaedov Faculty of Science, International Islaic University Malaysia P.O. Box, 4, 570, Kuantan, Pahang, Malaysia
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationON REGULARITY, TRANSITIVITY, AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV
ON REGULARITY TRANSITIVITY AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV Departent of Coputational & Theoretical Sciences Faculty of Science International Islaic University
More informationThe proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013).
A Appendix: Proofs The proofs of Theore 1-3 are along the lines of Wied and Galeano (2013) Proof of Theore 1 Let D[d 1, d 2 ] be the space of càdlàg functions on the interval [d 1, d 2 ] equipped with
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationA Fast Algorithm for the Spread of HIV in a System of Prisons
A Fast Algorith for the Spread of HIV in a Syste of Prisons Wai-Ki Ching Yang Cong Tuen-Wai Ng Allen H Tai Abstract In this paper, we propose a continuous tie odel for odeling the spread of HIV in a network
More informationA Markov Framework for the Simple Genetic Algorithm
A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationSTRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES
Annales Univ Sci Budapest, Sect Cop 39 (2013) 365 379 STRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES MK Runovska (Kiev, Ukraine) Dedicated to
More informationPoornima University, For any query, contact us at: , 18
AIEEE//Math S. No Questions Solutions Q. Lets cos (α + β) = and let sin (α + β) = 5, where α, β π, then tan α = 5 (a) 56 (b) 9 (c) 7 (d) 5 6 Sol: (a) cos (α + β) = 5 tan (α + β) = tan α = than (α + β +
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationNote on generating all subsets of a finite set with disjoint unions
Note on generating all subsets of a finite set with disjoint unions David Ellis e-ail: dce27@ca.ac.uk Subitted: Dec 2, 2008; Accepted: May 12, 2009; Published: May 20, 2009 Matheatics Subject Classification:
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationModeling Chemical Reactions with Single Reactant Specie
Modeling Cheical Reactions with Single Reactant Specie Abhyudai Singh and João edro Hespanha Abstract A procedure for constructing approxiate stochastic odels for cheical reactions involving a single reactant
More informationA note on the realignment criterion
A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationAN APPLICATION OF CUBIC B-SPLINE FINITE ELEMENT METHOD FOR THE BURGERS EQUATION
Aksan, E..: An Applıcatıon of Cubıc B-Splıne Fınıte Eleent Method for... THERMAL SCIECE: Year 8, Vol., Suppl., pp. S95-S S95 A APPLICATIO OF CBIC B-SPLIE FIITE ELEMET METHOD FOR THE BRGERS EQATIO by Eine
More informationMath 262A Lecture Notes - Nechiporuk s Theorem
Math 6A Lecture Notes - Nechiporuk s Theore Lecturer: Sa Buss Scribe: Stefan Schneider October, 013 Nechiporuk [1] gives a ethod to derive lower bounds on forula size over the full binary basis B The lower
More informationThe linear sampling method and the MUSIC algorithm
INSTITUTE OF PHYSICS PUBLISHING INVERSE PROBLEMS Inverse Probles 17 (2001) 591 595 www.iop.org/journals/ip PII: S0266-5611(01)16989-3 The linear sapling ethod and the MUSIC algorith Margaret Cheney Departent
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationResearch Article On the Isolated Vertices and Connectivity in Random Intersection Graphs
International Cobinatorics Volue 2011, Article ID 872703, 9 pages doi:10.1155/2011/872703 Research Article On the Isolated Vertices and Connectivity in Rando Intersection Graphs Yilun Shang Institute for
More informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher
More informationIntelligent Systems: Reasoning and Recognition. Artificial Neural Networks
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
More informationAsymptotics of weighted random sums
Asyptotics of weighted rando sus José Manuel Corcuera, David Nualart, Mark Podolskij arxiv:402.44v [ath.pr] 6 Feb 204 February 7, 204 Abstract In this paper we study the asyptotic behaviour of weighted
More informationThe Hilbert Schmidt version of the commutator theorem for zero trace matrices
The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More informationSupplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
Suppleentary Material for Fast and Provable Algoriths for Spectrally Sparse Signal Reconstruction via Low-Ran Hanel Matrix Copletion Jian-Feng Cai Tianing Wang Ke Wei March 1, 017 Abstract We establish
More information}, (n 0) be a finite irreducible, discrete time MC. Let S = {1, 2,, m} be its state space. Let P = [p ij. ] be the transition matrix of the MC.
Abstract Questions are posed regarding the influence that the colun sus of the transition probabilities of a stochastic atrix (with row sus all one) have on the stationary distribution, the ean first passage
More informationOn the characterization of non-linear diffusion equations. An application in soil mechanics
On the characterization of non-linear diffusion equations. An application in soil echanics GARCÍA-ROS, G., ALHAMA, I., CÁNOVAS, M *. Civil Engineering Departent Universidad Politécnica de Cartagena Paseo
More informationarxiv: v3 [cs.sy] 29 Dec 2014
A QUADRATIC LOWER BOUND FOR THE CONVERGENCE RATE IN THE ONE-DIMENSIONAL HEGSELMANN-KRAUSE BOUNDED CONFIDENCE DYNAMICS EDVIN WEDIN AND PETER HEGARTY Abstract. Let f k n) be the axiu nuber of tie steps taken
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationA Note on the Application of Incidence Matrices of Simplicial Complexes
Int. J. Contep. Math. Sciences, Vol. 8, 2013, no. 19, 935-939 HIKARI Ltd, www.-hikari.co http://dx.doi.org/10.12988/ijcs.2013.39105 A Note on the Application of Incidence Matrices of Siplicial Coplexes
More informationOn the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation
journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationCharacterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone
Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns
More informationThe Fundamental Basis Theorem of Geometry from an algebraic point of view
Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article
More informationCompleteness of Bethe s states for generalized XXZ model, II.
Copleteness of Bethe s states for generalized XXZ odel, II Anatol N Kirillov and Nadejda A Liskova Steklov Matheatical Institute, Fontanka 27, StPetersburg, 90, Russia Abstract For any rational nuber 2
More informationMetric Entropy of Convex Hulls
Metric Entropy of Convex Hulls Fuchang Gao University of Idaho Abstract Let T be a precopact subset of a Hilbert space. The etric entropy of the convex hull of T is estiated in ters of the etric entropy
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationLinguistic majorities with difference in support
Linguistic ajorities with difference in support Patrizia Pérez-Asurendi a, Francisco Chiclana b,c, a PRESAD Research Group, SEED Research Group, IMUVA, Universidad de Valladolid, Valladolid, Spain b Centre
More informationLecture 20 November 7, 2013
CS 229r: Algoriths for Big Data Fall 2013 Prof. Jelani Nelson Lecture 20 Noveber 7, 2013 Scribe: Yun Willia Yu 1 Introduction Today we re going to go through the analysis of atrix copletion. First though,
More informationarxiv:physics/ v1 [physics.bio-ph] 27 Jun 2001
Maternal effects in molecular evolution Claus O. Wilke Digital Life Laboratory, Mail Code 36-93, Caltech, Pasadena, CA 925 wilke@caltech.edu (Printed: May 3, 27) arxiv:physics/693v [physics.bio-ph] 27
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationarxiv: v2 [math.co] 8 Mar 2018
Restricted lonesu atrices arxiv:1711.10178v2 [ath.co] 8 Mar 2018 Beáta Bényi Faculty of Water Sciences, National University of Public Service, Budapest beata.benyi@gail.co March 9, 2018 Keywords: enueration,
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationAbout the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry
About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D
More informationarxiv: v1 [math.co] 19 Apr 2017
PROOF OF CHAPOTON S CONJECTURE ON NEWTON POLYTOPES OF q-ehrhart POLYNOMIALS arxiv:1704.0561v1 [ath.co] 19 Apr 017 JANG SOO KIM AND U-KEUN SONG Abstract. Recently, Chapoton found a q-analog of Ehrhart polynoials,
More informationApplied Mathematics Letters
PERGAMON Applied Matheatics Letters 15 (2002) 355-360 Applied Matheatics Letters www.elsevier.co/locate/al Soe Peculiarities of the General Method of Lyapunov Functionals Construction V. KOLMANOVSKII Moscow
More informationInclusions Between the Spaces of Strongly Almost Convergent Sequences Defined by An Orlicz Function in A Seminormed Space
Inclusions Between the Spaces of Strongly Alost Convergent Seuences Defined by An Orlicz Function in A Seinored Space Vinod K. Bhardwaj and Indu Bala Abstract The concept of strong alost convergence was
More informationRecursive Algebraic Frisch Scheme: a Particle-Based Approach
Recursive Algebraic Frisch Schee: a Particle-Based Approach Stefano Massaroli Renato Myagusuku Federico Califano Claudio Melchiorri Atsushi Yaashita Hajie Asaa Departent of Precision Engineering, The University
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationSlanted coupling of one-dimensional arrays of small tunnel junctions
JOURNAL OF APPLIED PHYSICS VOLUME 84, NUMBER 1 15 DECEMBER 1998 Slanted coupling of one-diensional arrays of sall tunnel junctions G. Y. Hu Departent of Physics and Astronoy, Louisiana State University,
More informationTesting Properties of Collections of Distributions
Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the
More informationGraphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationOn Conditions for Linearity of Optimal Estimation
On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at
More informationHandout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.
Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationLinear Algebra of Eigen s Quasispecies Model
Linear Algebra of Eigen s Quasispecies Model Artem Novozhilov Department of Mathematics North Dakota State University Midwest Mathematical Biology Conference, University of Wisconsin La Crosse May 17,
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationComparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations
International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationarxiv: v2 [math.co] 3 Dec 2008
arxiv:0805.2814v2 [ath.co] 3 Dec 2008 Connectivity of the Unifor Rando Intersection Graph Sion R. Blacburn and Stefanie Gere Departent of Matheatics Royal Holloway, University of London Egha, Surrey TW20
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationLean Walsh Transform
Lean Walsh Transfor Edo Liberty 5th March 007 inforal intro We show an orthogonal atrix A of size d log 4 3 d (α = log 4 3) which is applicable in tie O(d). By applying a rando sign change atrix S to the
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationWhen Short Runs Beat Long Runs
When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationStudy on Markov Alternative Renewal Reward. Process for VLSI Cell Partitioning
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 40, 1949-1960 HIKARI Ltd, www.-hikari.co http://dx.doi.org/10.12988/ia.2013.36142 Study on Markov Alternative Renewal Reward Process for VLSI Cell Partitioning
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationBeyond Mere Convergence
Beyond Mere Convergence Jaes A. Sellers Departent of Matheatics The Pennsylvania State University 07 Whitore Laboratory University Park, PA 680 sellers@ath.psu.edu February 5, 00 REVISED Abstract In this
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationTesting equality of variances for multiple univariate normal populations
University of Wollongong Research Online Centre for Statistical & Survey Methodology Working Paper Series Faculty of Engineering and Inforation Sciences 0 esting equality of variances for ultiple univariate
More informationComputable Shell Decomposition Bounds
Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung
More informationA new type of lower bound for the largest eigenvalue of a symmetric matrix
Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box
More informationSupport recovery in compressed sensing: An estimation theoretic approach
Support recovery in copressed sensing: An estiation theoretic approach Ain Karbasi, Ali Horati, Soheil Mohajer, Martin Vetterli School of Coputer and Counication Sciences École Polytechnique Fédérale de
More informationRademacher Complexity Margin Bounds for Learning with a Large Number of Classes
Radeacher Coplexity Margin Bounds for Learning with a Large Nuber of Classes Vitaly Kuznetsov Courant Institute of Matheatical Sciences, 25 Mercer street, New York, NY, 002 Mehryar Mohri Courant Institute
More informationThe Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost
More informationDeflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007
Deflation of the I-O Series 1959-2. Soe Technical Aspects Giorgio Rapa University of Genoa g.rapa@unige.it April 27 1. Introduction The nuber of sectors is 42 for the period 1965-2 and 38 for the initial
More informationPREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL
PREPRINT 2006:7 Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL Departent of Matheatical Sciences Division of Matheatics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG UNIVERSITY
More informationAn Algorithm for Quantization of Discrete Probability Distributions
An Algorith for Quantization of Discrete Probability Distributions Yuriy A. Reznik Qualco Inc., San Diego, CA Eail: yreznik@ieee.org Abstract We study the proble of quantization of discrete probability
More informationChapter 1: Basics of Vibrations for Simple Mechanical Systems
Chapter 1: Basics of Vibrations for Siple Mechanical Systes Introduction: The fundaentals of Sound and Vibrations are part of the broader field of echanics, with strong connections to classical echanics,
More informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationSupplement to: Subsampling Methods for Persistent Homology
Suppleent to: Subsapling Methods for Persistent Hoology A. Technical results In this section, we present soe technical results that will be used to prove the ain theores. First, we expand the notation
More informationDonald Fussell. October 28, Computer Science Department The University of Texas at Austin. Point Masses and Force Fields.
s Vector Moving s and Coputer Science Departent The University of Texas at Austin October 28, 2014 s Vector Moving s Siple classical dynaics - point asses oved by forces Point asses can odel particles
More information