Entropy increase and information loss in Markov models of evolution

  title={Entropy increase and information loss in Markov models of evolution},
  author={Elliott Sober and Mike A. Steel},
  journal={Biology \& Philosophy},
Markov models of evolution describe changes in the probability distribution of the trait values a population might exhibit. In consequence, they also describe how entropy and conditional entropy values evolve, and how the mutual information that characterizes the relation between an earlier and a later moment in a lineage’s history depends on how much time separates them. These models therefore provide an interesting perspective on questions that usually are considered in the foundations of… Expand

Figures from this paper

Relative Entropy in Biological Systems
This paper reviews various information-theoretic characterizations of the approach to equilibrium in biological systems, and explains various theorems that give conditions under which relative entropy is nonincreasing. Expand
Time and Knowability in Evolutionary Processes
This work uses a Moran process framework to show that some evolutionary processes destroy information faster than others, and connects with Darwin's principle that adaptive similarities provide scant evidence of common ancestry whereas neutral and deleterious similarities do better. Expand
Generalized Hidden Markov Models for Phylogenetic Comparative Datasets
The capabilities of the R package corHMM are expanded to handle n-state and n-character problems and provide users with a streamlined set of functions to create custom HMMs for any biological question of arbitrary complexity, finding that an HMM is an appropriate model when the degree of rate heterogeneity is moderate to high. Expand
Symmetry breaking and the emergence of path-dependence
It is proposed that historicity in networks should be understood as symmetry breaking, which permits a quantitative measure for how path-dependence can occur in degrees, and offers suggestive insights into how historicity is intertwined both with causal structure and complexity. Expand
Predicting the ancestral character changes in a tree is typically easier than predicting the root state.
Results from information theory indicate that for the standard Yule tree, the task of reconstructing internal node states remains feasible, even for very high substitution rates, and computer simulations demonstrate that this result still holds. Expand
Gradient Flow Formulations of Discrete and Continuous Evolutionary Models: A Unifying Perspective
The Moran process and the Kimura Equation are reformulate as gradient flows and the sequel discusses conditions such that the associated gradient structures converge, providing a geometric characterisation of these evolutionary processes and provides a reformulation of the above examples as time minimisation of free energy functionals. Expand
Information and Inaccuracy
A fourth interpretation of MI is proposed, where inaccuracy is measured by a strictly proper monotonic scoring rule and the answers to questions of information given by MI are definitive whenever this interpretation is appropriate, and that it is appropriate in a wide range of applications with epistemic implications. Expand


Entropy, Information and Evolution: New Perspectives on Physical and Biological Evolution
Can recent developments in thermodynamics and information theory offer a way out of the current crisis in evolutionary theory? One of the most exciting and controversial areas of scientific researchExpand
How much can evolved characters tell us about the tree that generated them?
This paper reviews some recent results that shed light on a fundamental question in molecular systematics: how much phylogenetic `signal' can the authors expect from characters that have evolved under some Markov process, and explores the relationship between the number of sites required for accurate tree reconstruction and other model parameters. Expand
Inconsistency of evolutionary tree topology reconstruction methods when substitution rates vary across characters.
  • J. Chang
  • Mathematics, Medicine
  • Mathematical biosciences
  • 1996
Examples are given showing that distance and maximum likelihood methods for topology estimation have been shown to be consistent under the homogeneity assumption, and that these methods can fail to be consistency when the homogeneous assumption is relaxed. Expand
Information theory, evolution and the origin of life
  • H. Yockey
  • Mathematics, Computer Science
  • Inf. Sci.
  • 2002
This chapter discusses the genetic information system, the central dogma of molecular biology, and the role of Haeckel's Urschleim in the origin of life. Expand
Modeling the covarion hypothesis of nucleotide substitution.
A covarion-style model for nucleotide substitution that allows sites to turn "on" and "off" with time is analyzed and it is shown how to obtain the evolutionary distance between two species from the expected proportion of sites where two species differ. Expand
Maximum parsimony on subsets of taxa.
This paper investigates mathematical questions concerning the reliability (reconstruction accuracy) of Fitch's maximum parsimony algorithm for reconstructing the ancestral state given a phylogenetic tree and a character and answers affirmatively a conjecture of Li, Steel and Zhang which states that under a molecular clock the probability that the state at a single taxon is a correct guess of the ancestralstate is a lower bound on the reconstruction accuracy of FITCH's method applied to all taxa. Expand
Evolutionary models of phylogenetic trees
  • I. Pinelis
  • Biology, Medicine
  • Proceedings of the Royal Society of London. Series B: Biological Sciences
  • 2003
A continuous multi–rate (MR) family of evolutionary models is presented which contains entire subfamilies corresponding to both the PDA and ERM models and is very versatile and virtually free of assumptions on the character of evolution; yet it is highly susceptible to rigorous analyses. Expand
Finite Markov chains
This lecture reviews the theory of Markov chains and introduces some of the high quality routines for working with Markov Chains available in QuantEcon.jl. Expand
On the Impossibility of Reconstructing Ancestral Data and Phylogenies
It is proved that it is impossible to reconstruct ancestral data at the root of "deep" phylogenetic trees with high mutation rates from a number of characters smaller than a low-degree polynomial in the number of leaves. Expand
Testing the hypothesis of common ancestry.
This work reviews and critically examines some arguments that have been proposed in support of the hypothesis that all life on earth traces back to a single common ancestor, and describes some theoretical results that suggest the hypothesis may be intrinsically difficult to test. Expand