We introduce an analytical model that predicts the dynamics of a simple evolutionary algorithm in terms of the flow in the space of fitness distributions. In the limit of infinite populations the equations of motion are derived in closed form. We show how finite populations induce periods of...

We analyze the population dynamics of a broad class of fitness functions that exhibit epochal evolution|a dynamical behavior, commonly observed in both natural and artificial evolutionary processes, in which long periods of stasis in an evolving population are punctuated by sudden bursts of...

Technological change at the firm level has commonly been modeled as random sampling from a fixed distribution o f possibilities. Such models, however, typically ignore empirically important aspects of the firm's search process, notably the observation that the present state of the firm guides...

Epochal dynamics, in which long periods of stasis in population fitness are punctuated by sudden innovations, is a common behavior in both natural and artificial evolutionary processes. We use a recent quantitative mathematical analysis of epochal evolution to estimate, as a function of...

During an immune response the affinity of antibodies that react with the antigen that triggered the response increases with time, a phenomenon known as affinity maturation. The molecular basis of affinity maturation has been partially elucidated. It involves the somatic mutation of immunoglobin...

We compare the frequency distribution of gene family sizes in the complete genomes of five Bacteria ({\it Escherichia coli, Haemophilus influenzae, Mycoplasma genitalium, Mycoplasma pneumoniae,} and {\it Synechocystis sp. PCC6803}), one Archaeon ({\it Methanococcus janaschii}), one eukaryote...

Evolving one-dimensional cellular automata (CAs) with genetic algorithms has provided insight into how improved performance on a task requiring global coordination emerges when only local interactions are possible. Two approaches that can affect the search efficiency of the genetic algorithm are...

Thermodynamic depth is an appealing but flawed complexity measure. It depends on a set of macroscopic states for a system, but neither its original introduction by Lloyd and Pagels nor any follow-up work has considered how to select these states. Depth, therefore, is at root subjective....

Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number of distinct products that these interactions can...