Phenotype robustness, defined as the average mutational robustness of all the genotypes that map to a given phenotype, plays a key role in facilitating neutral exploration of novel phenotypic variation by an evolving population. By applying results from coding theory, we prove that the maximum phenotype robustness occurs when genotypes are organized as bricklayer’s graphs, so-called because they resemble the way in which a bricklayer would fill in a Hamming graph. The value of the maximal robustness is given by a fractal continuous everywhere but differentiable nowhere sums-of-digits function from number theory. Interestingly, genotype–phenotype maps for RNA secondary structure and the hydrophobic-polar (HP) model for protein folding can exhibit phenotype robustness that exactly attains this upper bound. By exploiting properties of the sums-of-digits function, we prove a lower bound on the deviation of the maximum robustness of phenotypes with multiple neutral components from the bricklayer’s graph bound, and show that RNA secondary structure phenotypes obey this bound. Finally, we show how robustness changes when phenotypes are coarse-grained and derive a formula and associated bounds for the transition probabilities between such phenotypes.
Recent studies of genotype-phenotype maps have reported universally enhanced phenotypic robustness to genotype mutations, a feature essential to evolution. Virtually all of these studies make a simplifying assumption that each genotype—represented as a sequence—maps deterministically to a single phenotype, such as a discrete structure. Here we introduce probabilistic genotype-phenotype (PrGP) maps, where each genotype maps to a vector of phenotype probabilities, as a more realistic and universal language for investigating robustness in a variety of physical, biological, and computational systems. We study three model systems to show that PrGP maps offer a generalized framework which can handle uncertainty emerging from various physical sources: (1) thermal fluctuation in RNA folding, (2) external field disorder in the spin-glass ground state search problem, and (3) superposition and entanglement in quantum circuits, which are realized experimentally on IBM quantum computers. In all three cases, we observe a biphasic robustness scaling which is enhanced relative to random expectation for more frequent phenotypes and approaches random expectation for less frequent phenotypes. We derive an analytical theory for the behavior of PrGP robustness, and we demonstrate that the theory is highly predictive of empirical robustness.
23 August 2019 in Proceedings of the National Academy of Sciences
Within a tight-binding approximation, we numerically determine the time evolution of graphene electronic states in the presence of classically vibrating nuclei. There is no reliance on the Born–Oppenheimer approximation within the -orbital tight-binding basis, although our approximation is “atomically adiabatic”: the basis -orbitals are taken to follow nuclear positions. Our calculations show that the strict adiabatic Born–Oppenheimer approximation fails badly. We find that a diabatic (lazy electrons responding weakly to nuclear distortions) Born–Oppenheimer model provides a much more accurate picture and suggests a generalized many-body Bloch orbital-nuclear basis set for describing electron–phonon interactions in graphene.
Across many problems in science and engineering, it is important to consider how much the output of a given system changes due to perturbations of the input. Here, we investigate the glassy phase of spin glasses at zero temperature by calculating the robustness of the ground states to flips in the sign of single interactions. For random graphs and the Sherrington-Kirkpatrick model, we find relatively large sets of bond configurations that generate the same ground state. These sets can themselves be analyzed as subgraphs of the interaction domain, and we compute many of their topological properties. In particular, we find that the robustness, equivalent to the average degree, of these subgraphs is much higher than one would expect from a random model. Most notably, it scales in the same logarithmic way with the size of the subgraph as has been found in genotype-phenotype maps for RNA secondary structure folding, protein quaternary structure, gene regulatory networks, as well as for models for genetic programming. The similarity between these disparate systems suggests that this scaling may have a more universal origin.
21 August 2020 in Journal of Mathematics and Music
The standard 2-dimensional Tonnetz describes parsimonious voice leading connections between major and minor triads as the 3-dimensional Tonnetz does for dominant seventh and half-diminished seventh chords. In this paper, a 5-dimensional Tonnetz is introduced, providing a geometric framework for parsimonious voice leading among nearly symmetric hexachords of the mystic-Wozzeck genus. Cartesian coordinates for points on this discretized grid, generalized coordinate collections for the vertices of the 5-simplices corresponding to mystic and Wozzeck chords, and the geometric nearest-neighbours of a selected chord are derived.