The Azimuth Project
Blog - evolution and categories

This page is a blog article in progress, written by Cameron Smith. To discuss this article while it’s being written, visit the Azimuth Forum.

An attempt to review some of the literature on major transitions in evolution and multi-level selection, sketch a few connections to concepts in category theory, and discuss the potential for using experimental evolution to investigate and strengthen those connections.

Edit

contents

My thesis has been that one path to the construction of a non-trivial theory of complex systems is by way of a theory of hierarchy. Empirically, a large proportion of the complex systems we observe in nature exhibit hierarchic structure. On theoretical grounds we could expect complex systems to be hierarchies in a world in which complexity had to evolve from simplicity. -Herbert Simon, 1962

The prospects of a general theory of evolution point to an intellectual challenge inherent to the interrelationships between theories relevant to the domain of empirical science. Consider the level of organization concept. The presumption of energetic stratification among the contents of the universe has led to a corresponding stratification among the scientific theories that intend to address each of the perceived layered levels (Farre, 1997). These layers have come to be conceived of as levels of organization and scientific theories tend to address one of these levels (click the image to see the flash animation):

It might be useful to work explicitly on connecting theories that transcend levels of organization. One type of insight that could be gained from this approach is an understanding of the mutual development of bottom-up ostensibly mechanistic models of simple systems and top-down initially phenomenological models of complex ones.

Taking a monistic ideological perspective of science, a significant challenge is the development of a language able to unify descriptions of both simple and complex systems (see Simon, 1962 for a discussion of the quasi-continuum that ranges from simple to complex). Such a language is essential to facilitate efficient communication among scientists who work with complex systems that apparently transcend multiple levels of organization. Category theory may provide the nucleus of the framework necessary to formally address this challenge. But, in order to head in that direction, I’ll try out a few examples, albeit from the somewhat limited perspective of a biologist, from which some pattern(s) might begin to surface.

simple and complex systems

Blog - evolution and categories

What is the organizational structure of the products of evolutionary processes? Herbert Simon provides one perspective that I find intuitive in his parable of two watchmakers (Simon, 1962).

He argues that the existence of multiple stable intermediate modules that can be assembled hierarchically reduces the magnitude of the timescale, relative to that for systems lacking stable intermediates, for the evolution of complex systems. Given a particular set of internal and environmental constraints that can only be satisfied by some relatively complex system, a hierarchically organized one will be capable of meeting those constraints with the fewest resources and in the least time (i.e. most efficiently). Constraints inherent to a process define “stability”, and thus dictate the types of structures permitted to exist in its context. If hierarchical organization is an unavoidable outcome of evolutionary processes, it should be possible to characterize the generators that lead to its emergence.

Simon describes a property that most complex systems have in common that he refers to as near decomposability (ND) (Simon, 2002). Simon uses a coefficient matrix to describe a ND system:

This matrix illustrates a ND system of three layers, with two cells at the top level, each divided into two subcells, and each of these subdivided into three sub-subcells. The numbers of the rows and columns designate the cells, cells 1–6 and 7–12 constitute the two top-level subsystems, cells 1–3, 4–6, 7–9 and 10–12 the four second-level sub- systems. The interactions within the latter subsystems have intensity aa, those within the former two subsystems, intensity ϵ l\epsilon_l, and those between components of the largest subsystems, intensity ϵ 2\epsilon_2. (Simon, 2002)

Simon states that this matrix is in near-diagonal form because he assumes aϵ lϵ 2a\gg\epsilon_l\gg\epsilon_2. Another, probably more common, terminology for this would be near block diagonal. Simon also tells us that assuming linearity, this system can be modeled by a system of differential equations:

ddtT i(t)= ja ij(T j(t)T i(t)), \frac{d}{d t}T_i(t) = \sum_{j}a_{ij}\left(T_{j}(t)-T_{i}(t)\right),

where ii indexes rows, jj indexes columns, a ija_ij correspond to the entries (i.e. a,ϵ l,ϵ 2a,\,\,\epsilon_l,\,\,\epsilon_2) in the coefficient matrix, and the variables T iT_i (probably TT because he’s modeling the temperature in a fictional building called the Mellon institute) represent the variables at the lowest level of the hierarchy (in this case one of the twelve).

This is a trivial system, but it illustrates that the ND of the coefficient matrix allows these equations to be solved in a near hierarchical fashion. As an approximation, rather than simulating all the equations (e.g. twelve in this example but more generally i1...m\forall\,i \in 1...m) one can take a recursive approach and solve the four systems of three equations (each of the blocks containing aas), and average the results to produce initial conditions for two systems of two equations with coefficients:

[ϵ 1 ϵ 1 ϵ 2 ϵ 2 ϵ 1 ϵ 1 ϵ 2 ϵ 2 ϵ 2 ϵ 2 ϵ 1 ϵ 1 ϵ 2 ϵ 2 ϵ 1 ϵ 1], \begin{bmatrix} \epsilon_1 & \epsilon_1 & \epsilon_2 & \epsilon_2 \\ \epsilon_1 & \epsilon_1 & \epsilon_2 & \epsilon_2\\ \epsilon_2 & \epsilon_2 & \epsilon_1 & \epsilon_1 \\ \epsilon_2 & \epsilon_2 & \epsilon_1 & \epsilon_1 \end{bmatrix},

and then average those results to produce initial conditions for a single system of two equations with coefficients:

[ϵ 2 ϵ 2 ϵ 2 ϵ 2]. \begin{bmatrix} \epsilon_2 & \epsilon_2 \\ \epsilon_2 & \epsilon_2 \end{bmatrix}.

This example of heuristic simplification indicates that for systems possessing the ND property, a single system could be reduced to a series of smaller modules, which can be simulated in less computational time, if the error introduced in this approximation is tolerable. The degree to which this method saves time is dependent upon the relationship between the size of the whole system and the size and number of hierarchical levels. However, as an example, given the time complexity for matrix inversion (i.e. solving a system of linear equations) is O(n 2)O(n^2) then the hierarchical decomposition would lead to an algorithm with time complexity O((nL) 2)O\left(\left(\frac{n}{L}\right)^2\right), where LL is the number of levels in the decomposition (L=4L=4 in Simon’s example assuming the individual variables represent the lowest level).

All of this will need to be made much more precise; however, there are some potential metaphorical consequences for the evolution of complex systems:

If we begin with a population of systems of comparable complexity, some of which are ND and some of which are not, the ND systems will, on average, increase their fitness through evolutionary processes much faster than the remaining systems, and will soon come to dominate the entire population. Notice that the claim is not that more complex systems will evolve more rapidly than less complex systems, but that, at any level of complexity, ND systems will evolve much faster than systems of comparable complexity that are not ND. (Simon, 2002)

nested and non-nested hierarchies

Blog - evolution and categories

Even within the molecular level of biological systems, we observe a form of structural:

,

and functional:

,

hierarchical organization. The first picture shows the physical structure of the genome. The structural hierarchy here from micro\rightarrowmacro is roughly DNA\rightarrowNucleosome\rightarrowChromatosome\rightarrow fibers of increasing size… (see the descriptions in the numbered bubbles). The second figure shows several of the components involved in the regulation of gene expression. A protein called a transcriptional activator (there are also repressors) may bind to a particular type of DNA sequence called a promoter and recruit another type of protein called RNA polymerase to promote (i.e. in a stochastic model, increase the probability of…) the production of complementary RNA from the DNA template. However, the transcriptional activator may be prevented from accessing the promoter DNA if the DNA is tightly wound up around the proteins called histones. The enzymes that regulate the degree to which certain stretches of the DNA are condensed around histones are called histone modification enzymes. The process by which histone modification enzymes regulate gene expression is a form of epigenetic regulation (of which there are several other types). Thus, we see that here we have something that might be termed a functional hierarchy wherein the histone modification enzymes represent a meta-level control of gene expression with respect to that of transcription factors (TFs being a slightly more general term subsuming both activators and repressors).

There is a property that allegedly differs between these examples of one structural and one functional hierarchy. The structural hierarchy is nested (all lower levels are physically contained within all higher levels) whereas the functional one is not (Allen and Starr, 1982).

Presumably, the structure of the genome is itself functional, and the way in which I have presented genome organization and regulation has implied a false dichotomy. I believe the description I have provided above is representative of what most young biologists are taught. In the light of evolution, multi-level selection theory in particular, the genome structure can be viewed as a functional hierarchy whose timescale of change is, on average, longer than that of the expression of a gene. The tendency to impose a semantic distinction between “structural” and “functional” hierarchies, as I have recapitulated here, is, I suspect, simply a method of implicitly expressing relative timescales of stability. Nested hierarchies may evolve from non-nested hierarchies if the relatively transient interactions that constitute the non-nested hierarchy are stabilized via selection. If this occurs, however, a previously non-existant level emerges at which a non-nested hierarchy may come to exist. If this process were iterated, nested hierarchies emerging from non-nested ones and vice versa, it would bring into existence succesively higher levels: non-nestedn_n n=n+1\stackrel{n=n+1}{\leftrightarrow} nestedn_n.

the organism-environment duality

Blog - evolution and categories

Population genetics is a branch of biology that takes as its mode of abstraction the proportions of particular genotypes within a given population. A meaningful conceptualization of fitness, for which concrete examples can be devised, seems to me to be a significant impediment to population genetics theory. One reason for this is that any type of individual entity, no matter the hierarchical level on which it is perceived to exist, is composed of a network of traits that interact both among themselves (e.g. epistasis among genes) and with a dual network of factors that constitute said individual entity’s environment. It might be useful to go further and abstract away the conceptual division between organism and environment altogether, in order to incorporate both into a single network, as I believe many theoretical ecologists would argue. But, if we are to maintain the conceptual organism-environment distinction, I think it will be necessary in constructing a higher-level model to incorporate models of the environment which are at least equally complex to that of the organism. As an example in this direction, the notion of a so-called fitness landscape as exhibited by the NK model takes a step in the right direction. The relationship between organism and environment is more like frustrated spin glasses than a smooth climb up a single global fitness peak. Probably the closest concept to frustration that has been directly studied in biology is that of host-parasite antagonistic coevolution, which I would use as a metaphor to environment-organism antagonistic coevolution with environment and organism being analogous to host and parasite respectively. One naïve approach is to study population genetic models, which tend to take the organism as their focal point, and just upon reaching what seems to be a satisfactory description of an organism, or population thereof, turn the conceptualization on its head to determine what has been implied about the environment. It may then be possible to enrich the environmental description to be on par with that of the biological entities of focus (e.g. molecules, organisms, populations, …).

multi-level selection

Blog - evolution and categories

A model that unifies all types of selection (chemical, sociological, genetical, and every other kind of selection) may open the way to develop a general ‘Mathematical Theory of Selection’ analogous to communication theory. -George R. Price, 1971

The Price equation (sometimes referred to as Price’s theorem) provides a statistical description of an evolutionary process. It partitions the average change in the value of the population averaged value of a trait z(Δz)z\,\,(\Delta z) between generations into components due to selection and transmission. What is meant by selection and transmission can begin to be understood from a cartoon:

,

Example of a selective system using the notation of the Price Equation. The initial population, the left column of beakers, is divided into subpopulations indexed by ii, where q iq_i is the fraction of the total population in the ii-th subpopulation. In this drawing, the two different kinds of transmissible material, solid and striped, are in separate subpopulations initially, but that is not necessary. Each subpopulation expresses a character value (phenotype), z iz_i. Any arbitrary rule can be used to assign trait values. Selection describes the changes in the quantities of the transmissible materials, where the primes on symbols denote the next time period. Thus q i=q iw i/w¯q'_i = q_i w_i/\bar{w} is the proportion of the descendant population derived from the ii-th subpopulation of the initial population. The transmissible material may be redistributed to new groupings during or after the selective processes. The q ji˙q'_{j \dot i} are the fractions of the ii-th parental subpopulation, after selection, that end up in the jj-th descendant subpopulation, thus jq ji˙=1\sum_j q'_{j \dot i} = 1. The new mixtures in the jj-th subpopulations express trait values y jy_j according to whatever arbitrary rules are in effect. This allows full context-dependence (non-additivity) in the phenotypic expression of the transmissible material. Descendant trait values are assigned to the original subpopulations by weighting the contributions of those subpopulations, z i= jq ji˙y jz'_i = \sum_j q'_{j \dot i} y_j. Thus, the average trait value in the descendant population is z¯= iq iz i\bar{z}' = \sum_i q'_i z'_i (Frank, 1995, Fig. 1).

The two terms in the Price equation are:

  • the covariation between the fitness relative to the population average (v i=w iw)\left(v_i=\frac{w_i}{w}\right) and the trait value,
  • and the fitness-weighted expected value of the change in the trait value between generations (Price, 1970, Price, 1972, Price, 1995).

First I’ll provide a construction of the Price equation, using slightly different notation from the figure legend above, and then discuss it’s meaning in more detail.

Definition

If n i *n_i \in \mathbb{Z}^* is the number of occurrences for each x i,y ix_i,\,y_i \in \mathbb{R} then:

The expected value of the x ix_i values weighted by n in_i is:

(1)E(x i)=def ix in i in i. \operatorname{E}(x_i) \stackrel{\mathrm{def}}{=} \frac{\sum_i x_i n_i}{\sum_i n_i}.

The covariance between the x ix_i and y iy_i values weighted by n in_i is:

(2)Cov(x i,y i)=def in i[x iE(x i)][y iE(y i)] in i=E(x iy i)E(x i)E(y i). \operatorname{Cov}(x_i,y_i) \stackrel{\mathrm{def}}{=} \frac{\sum_i n_i[x_i-\operatorname{E}(x_i)][y_i-\operatorname{E}(y_i)]}{\sum_i n_i} = \operatorname{E}(x_i y_i)-\operatorname{E}(x_i)\operatorname{E}(y_i).
Definition

Suppose there is a population (a set) wherein each individual entity has a characteristic described by a number\in \mathbb{R}. For example, high values of the number for one individual represent an increased value for that characteristic over some other individual with a lower value. Value is not equivocated here with fitness (to be defined). Let subscript ii identify the group with characteristic values z iz_i and let n in_i be the number of individuals in that group. The total number of individuals is then nn where:

n= in i. n = \sum_i n_i.

The average value of the characteristic, zz, is defined as:

(3)z=defE(z i)=1n iz in i. z \stackrel{\mathrm{def}}{=} \operatorname{E}(z_i) = \frac{1}{n} \sum_i z_i n_i.
Definition

Suppose that the population reproduces, all parents are eliminated, and there is a selection process on the offspring, by which offspring deemed less fit are removed from the reproducing population. After reproduction and selection, the population numbers for the offspring groups will change to n jn'_j. Primes or jindicesj-indices denote relevance to the offspring population, and the absence of primes or iindicesi-indices, the like for the parent population.

The total number of offspring is nn' where:

n= in i. n' = \sum_i n'_i.
Definition

The fitness of group ii will be defined to be the within-group ratio of offspring to parents:

(4)w i=n in i, w_i = \frac{n'_i}{n_i},

with average fitness of the population being

(5)w=defE(w i)=1n iw in i=1n in in in i=1n in i=nn. w \stackrel{\mathrm{def}}{=} \operatorname{E}(w_i) = \frac{1}{n} \sum_i w_i n_i = \frac{1}{n} \sum_i \frac{n'_i}{n_i} n_i = \frac{1}{n} \sum_i n'_i = \frac{n'}{n}.

The average value of the offspring characteristic will be zz' where:

(6)z = 1n jz jn j, = 1n iw iwz in i, \begin{array}{rcl} z' & = & \frac{1}{n'} \sum_{j} z'_j n'_j, \\ & = & \frac{1}{n} \sum_{i} \frac{w_i}{w} z'_i n_i, \end{array}

z iz'_i represent the average character values of the offspring of each group ii, and z jz'_j represent the character values of the offspring for the (potentially different) groupings jj. Thus, the average character value of the offspring population, zz', can be determined summing over the parent, ii, or offspring, jj, population groupings.

Theorem

(Price’s theorem). The change in the population averaged trait value, Δz=zz\Delta z = z'-z, between generations is given by:

wΔz=Cov(w i,z i)+E(w iΔz i) w\,\Delta z = \operatorname{Cov}(w_i,z_i)+\operatorname{E}(w_i\,\Delta z_i)
Proof

Equation (2) shows that:

(7)Cov(w i,z i)=E(w iz i)wz \operatorname{Cov}(w_i,z_i)=\operatorname{E}(w_i z_i)-w z

Call the change in characteristic value from parent to child populations Δz i\Delta z_i so that Δz i=z iz i\Delta z_i = z'_i - z_i. As seen in Equation (1), the expected value operator E\operatorname{E} is linear, so

(8)E(w iΔz i)=E(w iz i)E(w iz i) \operatorname{E}(w_i\,\Delta z_i)=\operatorname{E}(w_i z'_i)-\operatorname{E}(w_i z_i)

Combining Equations (7) and (8) leads to

(9)Cov(w i,z i)+E(w iΔz i)=(E(w iz i)wz)+(E(w iz i)E(w iz i))=E(w iz i)wz \operatorname{Cov}(w_i,z_i)+\operatorname{E}(w_i\,\Delta z_i) = \bigl(\operatorname{E}(w_i z_i)-w z \bigr) + \bigl(\operatorname{E}(w_i z'_i)-\operatorname{E}(w_i z_i)\bigr) = \operatorname{E}(w_i z'_i)-w z

but from Equation (1) gives:

E(w iz i)=1n iw iz in i \operatorname{E}(w_i z'_i)=\frac{1}{n} \sum_i w_i z'_i n_i

and from Equation (4) gives:

(10)E(w iz i)=1n in in iz in i=1n in iz i=nn iz in in \operatorname{E}(w_i z'_i)=\frac{1}{n} \sum_i\frac{n'_i}{n_i}z'_i n_i = \frac{1}{n} \sum_i n'_i z'_i=\frac{n'}{n}\frac{\sum_i z'_i n'_i}{n'}

Applying Equations (5) and (6) to Equation (10) and then applying the result to Equation (9) gives the Price Equation:

(11)Cov(w i,z i)+E(w iΔz i)=wzwz=wΔz \operatorname{Cov}(w_i,z_i)+\operatorname{E}(w_i\,\Delta z_i)=w z'-w z=w\,\Delta z
Definition

Let the relative fitness of individual ii be:

(12)v i=defw iw v_i \stackrel{\mathrm{def}}{=} \frac{w_i}{w}
Lemma

The relative fitness formulation of the Price equation is:

(13)Δz=Cov(v i,z i)+E(v iΔz i) \Delta z = \operatorname{Cov}(v_i,z_i)+\operatorname{E}(v_i\,\Delta z_i)
Proof

Combining Equation (12) with Theorem 1 and the definitions of the E\operatorname{E} and Cov\operatorname{Cov} operators in Equations (1) and (2) respectively:

(14)Δz = Cov(w iw,z i)+E(w iwΔz i) = Cov(v i,z i)+E(v iΔz i) \begin{array}{rcl} \Delta z & = & \operatorname{Cov}\left(\frac{w_i}{w},z_i\right)+\operatorname{E}\left(\frac{w_i}{w}\,\Delta z_i\right) \\ & = & \operatorname{Cov}(v_i,z_i)+\operatorname{E}(v_i\,\Delta z_i) \end{array}

It is essential to emphasize the change of indices between jj (offspring) and ii (parents) in Equation (6). This indicates that the descendant population can have different groupings from the parent population. If we actually want to write down an explicit method of computing z iz'_i, we have to have kept track of something about the relationship between the groupings in the parent and child populations:

z i=1n i jn ijz j, z'_i = \frac{1}{n_i} \sum_j n_{i j} z'_j,

where n ijn_{i j} represents the number of individuals in group jj of the offspring population derived from group ii of the parent population (see the figure legend above and (Frank, 1995)). This seems to be a significant limitation because it requires interrogation of the distribution of the offspring population. In fact, it also implies that the price equation is purely retrospective rather than predictive.

What is the meaning of the Price equation? The first term, Cov(v i,z i)\operatorname{Cov}(v_i,z_i), measures the statistical relationship between the trait value, zz, and the relative fitness vv. That is, if higher values for a particular trait are positively correlated with relative fitness this term will be positive and if negatively correlated it will be negative. If there is no statistical association or if there is variation neither in relative fitness nor trait value, then Cov(v i,z i)=0\operatorname{Cov}(v_i,z_i)=0. Thus, Cov(v i,z i)\operatorname{Cov}(v_i,z_i) measures the degree to which the trait in question is subject to selection, thereby encapsulating the organism-environment relationship for a single trait. It is sometimes called the selection differential. The second term in the Price equation, E(v iΔz i)\operatorname{E}(v_i\,\Delta z_i), is a measure of the so-called transmission bias of the trait. Each individual in the population has a Δz i\Delta z_i, so E(v iΔz i)\operatorname{E}(v_i\,\Delta z_i) is a fitness-weighted expectation that relays both the degree to which the offspring of individual ii deviate from it in trait value as well as its number of offspring.

What is perhaps most interesting about the Price equation is that it can be expanded into what might be conceptualized as an arbitrary number of hierarchical levels due to its recursive nature. To my knowledge, Arnold and Fristrup were the first to describe this in detail (Arnold and Fristrup, 1982). The following is a construction of the hierarchical formulation of the Price equation for an arbitrary number of hierarchical levels.

Definition

Given an ordered set of sets of indices ={𝕂,𝕃,,𝕄} \mathfrak{I} = \{ \mathbb{K}, \mathbb{L}, \ldots\, , \mathbb{M} \} where 𝕂={k|k *,k=1K}\mathbb{K}= \{ k | k \in \mathbb{Z}^*, k = 1 \ldots\, K \} there are operations on the index sets such that 𝕂1=𝕃\mathbb{K} \oplus 1 = \mathbb{L} and 𝕃1=𝕂\mathbb{L} \ominus 1 = \mathbb{K}.

Lemma

The nested hierarchical form of the Price equation is:

(15)wΔz= Cov k(w k,z k) +E k(Cov l(w kl,z kl) +E l(E m1(Cov m(w klm,z klm) +E m(w klmΔz klm)))). \begin{split} w\,\Delta z =& \operatorname{Cov}_k(w_k,z_k) \\ & +\, \operatorname{E}_k ( \operatorname{Cov}_l(w_kl,z_kl) \\ & +\, \operatorname{E}_l (\,\, \cdots\,\, \operatorname{E}_{m \ominus 1}( \operatorname{Cov}_m(w_{k l\, \cdots\, m},z_{k l\, \cdots\, m}) \\ & +\, \operatorname{E}_m(w_{k l\, \cdots\, m} \Delta z_{k l\, \cdots\, m}))\,\, \cdots \,\,)). \end{split}

The number of levels in the hierarchy is equal to |||\mathfrak{I}|.

Proof

Equation (15) is a direct result of writing the terms describing wΔzw\,\Delta z in succession:

(16)wΔz = Cov(w k,z k)+E(w kΔz k), w kΔz k = Cov l(w kl,z kl)+E l(w klΔz kl), w klΔz kl = Cov l1(w kl(l1),z kl(l1))+E l1(w kl(l1)Δz kl(l1)), w klm1Δz klm1 = Cov m(w klm,z klm)+E m(w klmΔz klm). \begin{array}{rcl} w\,\Delta z &=& \operatorname{Cov}(w_k,z_k)+\operatorname{E}(w_k\,\Delta z_k), \\ w_k\,\Delta z_k &=& \operatorname{Cov}_l(w_{k l},z_{k l})+\operatorname{E}_l(w_{k l}\,\Delta z_{k l}), \\ w_{k l}\,\Delta z_{k l} &=& \operatorname{Cov}_{l \oplus 1}(w_{k l (l \oplus 1)},z_{k l (l \oplus 1)})+\operatorname{E}_{l \oplus 1}(w_{k l (l \oplus 1)}\,\Delta z_{k l (l \oplus 1)}), \\ &\vdots& \\ w_{k l \cdots\, m \ominus 1}\,\Delta z_{k l \cdots\, m \ominus 1} &=& \operatorname{Cov}_m(w_{k l \cdots\, m},z_{k l \cdots\, m}) + \operatorname{E}_m(w_{k l \cdots\, m} \Delta z_{k l \cdots\, m}). \end{array}

Equation (15) results from substitution of each of Equations (16) into its immediate predecessor until the first of the set of equations (16) is reached.

The meaning of the hierarchical formulation of the Price equation can be understood by considering each of Equations (16) as encapsulating the separation of the evolutionary process of some abstract characteristic into selection and transmission components each for a particular hierarchical level. Equation (15) is simply the composition of all of Equations (16). In their current form Equations (16) cannot be viewed as a mapping with a domain and co-domain. If we were to try to use the difference Equations (16) to update the necessary input data over a series of iterations, then defining the domain appears to require knowledge of characteristic values decomposed into the relevant set of hierarchical levels and summarized in some tensor Z KLM\mathbf{Z}_{K L\, \cdots\, M} with dim{Z}=K×L××M\operatorname{dim} \{ \mathbf{Z} \} = K \times L \times \cdots\, \times M. A similar tensor is required to describe the fitness values {w klm}\{w_{k l\, \cdots\, \m} \}. In each case, however, we need equivalent tensors for the offspring population in order to compute the z iz'_i. In order to update the characteristic value tensor for a single iteration we would have to add an average over a dimension to each indexed element in that dimension. Thus, information required to fully reconstruct rather than summarize statistically the character value distribution of the offspring of each parent or parent group would be lost in each generation. In summary, as mentioned above, despite its potential usefulness as a conceptual tool, in its current form we could only use the Price equation to compare to an experiment if we had complete data for both the parent and offspring populations over all generations of interest. Later I’ll attempt to derive a stochastic version of the Price equation that might be more useful in attempting to embed it, or something else, within a higher-level framework.

I’ll probably need a lot of help with this over on the forum!

Another limitation of the Price equation is that the fitness values do not evolve themselves. Referring back to the organism-environment duality it appears here that, while organisms in the environment are dynamic, the environment, which ultimately defines fitness is static. While this may be true over appropriately defined timescales, it is certainly not true in general. A model taking into account this intuitive relationship, while refusing to let go of a distinction between organisms and environments, would allow for the coevolution of the environment (thus fitness). Alternatively, we could take the point of view that an organism, indeed all organisms, simply represent a particular subset of hierarchical levels embedded within a larger network representing the “environment”. In this context, the underlying levels, molecules, organisms, populations, communities, ecosystems, and the overlying levels may all be subsumed into a single framework wherein something like an “organism” would simply represent a pattern that can be detected via some, ideally analytical, means within a single “global” type of network. This is perhaps where the project I’m working on converges in some sense with that of John and Jacob.

major transitions in evolution

Blog - evolution and categories

One of the first attempts to consider so-called major transitions in evolution comprehensively was Maynard Smith and Szathmary’s (Maynard Smith and Szathmary, 1995)

Still putting together what I want to say about this…

a categorical view of evolutionary processes

Blog - evolution and categories

This is clearly the least developed and probably most important section with which I will require the most help if it is to become comprehensible or useful!: Azimuth Forum.

Among the capabilities of the categorical language applied to the science of complex systems as described in Ehresmann and Vanbremeersch are, apparently, a characterization of the interface between simple and complex, a statement of the necessary conditions for reductionist theories to be successful in recapitulating natural systems, and a corresponding identification of the range of considerations necessary to construct reliable models when reductionism is insufficient. All of these constructions discussed in the first several chapters of MES are intellectually tantalizing, and it will be interesting to see where all of the directions suggested in MES could lead us. In any case, what I hope to discuss here, is a bit more modest.

Although recklessly premature, I cannot resist juxtaposing these two figures:


There is probably some other structure (or at the very least a series of adjectives may need to be added for any modicum of precision) more appropriate for embedding either a model of hierarchical evolution, or the hierarchical price equation-which are probably not the same given that the former expresses an ideal and the latter a practical result in the potential direction of that ideal. The rough notion of an evolutionary process modeled as a fibration wherein there is a, perhaps nn-, category representing a collection of interacting objects that constitute an evolving system whose slicing parameter is identified with time. This is how EV define it:

Definition

If K\mathbf{K} is an evolutive system, the fibration FK\mathbf{FK} associated to K\mathbf{K} is a quasi-category which has for its set of objects the set |K||K| of all the objects of K\mathbf{K}, and which is generated by its following sub-categories (see the figure above):

  1. The configuration categories K tK_t for each tt; their links are called vertical links. K tK_t is also called the fiber at tt.
  2. The category associated to the order ‘earlier than or simultaneous with’ on |K||K|; these links are called horizontal links.

There are many definitions before and after this one in MES; however, the meaning of EV’s term evolutive system is probably the least decipherable without a slightly more explicit definition:

Definition

An evolutive system (or ESES) K\mathbf{K} consists of the following (see figure below):

  1. A time scale TT, which is an interval or a finite subset of *\mathbb{Z}^*.
  2. For each instant tt of TT, a category K tK_t called the configuration category at tt. These categories are disjoint.
  3. For each instant t>tt' \gt t, a partial functor k(t,t)k(t,t') from K tK_t to K tK_{t'}, called the transition from tt to tt'. These transitions satisfy the following transitivity condition (TC), given t<t<tt \lt t' \lt t'' in TT:

: (TC) If the object A tA_t has A tA_{t'} for its new configuration at tt', and if A tA_{t'} has a new configuration A tA_{t''} at tt'', then A tA_{t''} is also the image of A tA_t by the transition from tt to tt''. Conversely, if B tB_t transitions to a configuration B tB_{t'} at tt' and to a configuration B tB_{t''} at tt'', then B tB_{t'} must transition to a configuration at tt'', and this configuration is B tB_{t''}. Similarly for the links.

references

Blog - evolution and categories

T. F. H. Allen and T. B. Starr, Hierarchy: Perspectives for Ecological Complexity. Chicago: University of Chicago Press, 1982, p. 326. \hookleftarrow

A. J. Arnold and K. Fristrup, The theory of evolution by natural selection: a hierarchical expansion, Paleobiology, vol. 8, no. 2, pp. 113–129, 1982. \hookleftarrow

A. C. Ehresmann and J. P. Vanbremeersch, Memory Evolutive Systems; Hierarchy, Emergence, Cognition, Volume 4 (Studies in Multidisciplinarity). Elsevier Science, 2007, p. 402. \hookleftarrow

G. L. Farre, The Energetic Structure of Observation: A Philosophical Disquisition, American Behavioral Scientist, vol. 40, no. 6, pp. 717-728, May. 1997. \hookleftarrow

S. A. Frank, George Price’s contributions to evolutionary genetics., Journal of theoretical biology, vol. 175, no. 3, pp. 373-88, Aug. 1995. 1\hookleftarrow^1 2\hookleftarrow^2

S. A. Frank, Foundations of social evolution. Princeton Univ Press, 1998. \hookleftarrow

S. Okasha, Evolution and the levels of selection. New York: Oxford University Press, USA, 2006. \hookleftarrow

G. R. Price, Selection and Covariance, Nature, vol. 227, no. 5257, pp. 520-521, Aug. 1970. \hookleftarrow

G. R. Price, Extension of covariance selection mathematics, Annals of Human Genetics, vol. 35, no. 4, pp. 485-490, Apr. 1972. \hookleftarrow

G. R. Price, The nature of selection, Journal of Theoretical Biology, vol. 175, no. 3, pp. 389-396, Aug. 1995. (written ca. 1971 and published posthumously) \hookleftarrow

H. A. Simon, The architecture of complexity, Proceedings of the American Philosophical Society, vol. 106, no. 6, pp. 467–482, 1962. 1\hookleftarrow^1 2\hookleftarrow^2

H. A. Simon, Near decomposability and the speed of evolution, Industrial and Corporate Change, vol. 11, no. 3, pp. 587-599, Jun. 2002. 1\hookleftarrow^1 2\hookleftarrow^2 3\hookleftarrow^3

J. Maynard Smith and E. Szathmáry, The major transitions in evolution. New York: Oxford University Press, USA, 1995. \hookleftarrow

Blog - evolution and categories

category: blog, biology