\documentclass[12pt,titlepage]{article}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}
%----Macros----------
%
% Unresolved issues:
%
% \righttoleftarrow
% \lefttorightarrow
%
% \color{} with HTML colorspec
% \bgcolor
% \array with options (without options, it's equivalent to the matrix environment)
% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}
% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.
% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother
% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
\ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
\else \append@sup#2 \@suptrue \fi%
\expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
\reset@sup\mk@scripts#3_/}
\makeatother
% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
\@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
\copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother
% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
% http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}
% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}
% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}
% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}
% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
<-6> MnSymbolE5
<6-7> MnSymbolE6
<7-8> MnSymbolE7
<8-9> MnSymbolE8
<9-10> MnSymbolE9
<10-12> MnSymbolE10
<12-> MnSymbolE12}{}
% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
\let#1=\undefined
\DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother
% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
\if\relax\noexpand#1%
\let#1\undefined
\fi
\DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother
% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
\setbox\z@\hbox{\m@th$#1#2$}%
\setbox\tw@\hbox{\m@th$#1%
\widehat{%
\vrule\@width\z@\@height\ht\z@
\vrule\@height\z@\@width\wd\z@}$}%
\dp\tw@-\ht\z@
\@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
\setbox\tw@\hbox{%
\raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
{\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother
% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter
% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother
%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}
%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}
% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}
%-------------------------------------------------------------------
\begin{document}
%-------------------------------------------------------------------
\section*{Invasion fitness in moment-closure treatments (part 4)}
This page has been superceded by my thesis.
\emph{Continued from [[Invasion fitness in moment-closure treatments (part 3)|Part 3]].}
\hypertarget{example_3_evolution_of_altruism}{}\subsubsection*{{Example 3: Evolution of Altruism}}\label{example_3_evolution_of_altruism}
One application of this machinery has been to understand how evolution can produce \emph{altruistic behaviour.} A behaviouristic definition of ``altruism'' would go something like, ``Acting to increase the reproductive success of another individual at the expense of one's own''. This can be written out using game theory; one defines a parameter $b$ to stand for benefit, $c$ to stand for cost and a payoff function which depends on $b$, $c$ and the strategy employed by an organism.
We shall consider a lattice of sites, each one of which can be in one of three states: \emph{empty,} denoted by 0; occupied by a \emph{selfish organism,} denoted by $S$; and occupied by an \emph{altruist,} denoted by $A$.
In the reproduction process, an organism spawns an offspring into an adjacent empty lattice site. This turns a pair of type $S 0$ into a pair of type $S S$. At what rate should the transition $S 0 \rightarrow S S$ occur? If we presume some baseline reproductive rate, call it $b_0$, then the presence of altruistic neighbours should \emph{augment} that rate. We'll say that if the number of nearby altruists is $n_A$, then selfish individuals will reproduce at a rate $b_0 + B n_A / n$, where the parameter $B$ specifies how helpful altruists are. The reproduction process for altruists, which we can write $A 0 \rightarrow A A$, occurs at a rate $b_0 + B n_A / n - C$. Here, the parameter $C$ is the \emph{cost} of altruism: it's how much an altruist gives up to help others.
In the differential equation for $d p_{S 0}/d t$, the $S 0 \rightarrow S S$ transition contributes a term proportional to the density of $S 0$ pairs:
\begin{displaymath}
-[(1 - \phi) b_S + (b_S + m) \phi q_{S|0 S}] p_{S 0},
\end{displaymath}
where we have written $\phi$ for $1 - 1/z$, to save a little ink. All things told, the rate of change of $p_{S 0}$ is given by
\begin{displaymath}
\begin{array}{rcl}
\frac{d p_{S 0}}{d t} &= &(b_s + m) \phi q_{S|0 0} p_{0 0}\\
& & - [d_S + m \phi q_{0|S 0}] p_{S 0}\\
& & - [(1 - \phi) b_s + (b_S + m) \phi q_{S|0 S}] p_{S 0}\\
& & + [d_S + m \phi q_{0|S S}] p_{S S}\\
& & - (b_A + m) \phi q_{A|0 S} p_{S 0}\\
& & + [d_A + m \phi q_{0|A S}] p_{S A}.
\end{array}
\end{displaymath}
Yuck! After writing a few equations like that, it's easy to wonder if maybe we should look for \emph{new mathematical ideas} which could help us better organise our thinking.
The next steps follow the general plan we laid out above. We write differential equations for the pairwise probabilities $p_{a b}$, which depend on triplet quantities $q_{a|b c}$. Then, we impose a pair approximation, declaring that $q_{a|b c} = q_{a|b}$, which gives us a closed system of equations. Next, we find the fixed point with $p_A = 0$, and we perturb around that fixed point to see what happens when a strain of altruists is introduced into a selfish population. The dominant eigenvalue $\lambda$ of the time-evolution matrix $T$ tells us, in this approximation, whether the altruistic strain will invade the lattice or wither away. The condition $\lambda \gt 0$ can be written in the form
\begin{displaymath}
B \phi \tilde{q}_{A | A} - C \gt 0.
\end{displaymath}
Here, we've written $\tilde{q}_{A | A}$ for the conditional probability of altruists contacting altruists which obtains as the local densities equilibrate. That is to say, an attempted invasion by altruists will succeed if a measure of benefit, $B$, multiplied by an indicator of ``assortment'' among genetically similar individuals, is greater than the cost of altruistic behaviour, $C$.
After all our mucking with eigenvalues, we have found a condition which is strongly reminiscent of a classic and influential idea from mid-twentieth-century evolutionary theory. In biology, the inequality
\begin{displaymath}
(benefit) \times (relatedness) \gt (cost)
\end{displaymath}
is known as \textbf{Hamilton's rule} (\hyperlink{VanDyken2011}{Van Dyken \emph{et al.,} 2011}). This is a rule-of-thumb for when natural selection can favour altruistic behaviour: altruists can prosper when the inequality is satisfied. Hamilton's rule was originally derived for unstructured populations, with no network topology or spatial arrangement to them. We can understand Hamiltion's rule in this context in the following way:
How well an organism fares in the great contest of life depends on the environment it experiences. During the course of its life, an individual member of a species will interact with a set of others, which we could call its ``social circle''. The composition of that social circle affects how well an individual will propagate its genetic information to the next generation --- its \emph{fitness.} In an unstructured population, we can think of such circles being formed by taking random samples of the population. An altruist, by our definition, sacrifices some of its own potential so that offspring of other individuals can prosper. A social circle of altruists can fare better than a social circle of selfish individuals, increasing the chances that social circles which form in the next generation will contain altruists (\hyperlink{VanDyken2011}{Van Dyken \emph{et al.,} 2011}).
It's common to treat ``benefit'' and ``cost'' as parameters of the system. We could potentially derive them from more fundamental dynamics, if we looked more closely at the interactions within a particular ecosystem, but right now, they're just knobs we can turn. What about the remaining quantity in Hamilton's rule: what does ``relatedness'' mean? Excellent question! We can get a feel for where the term came from by taking a gene's-eye view: copies of many of my particular genetic variants will be sitting inside the cells of my close relatives. Consequently, as far as my genes are concerned, if my relatives survive, that's almost as good as my surviving. When reckoning the benefit of altruism against its cost, then, the aid one organism brings to another ought to be weighted by how ``related'' they are.
So, we can say that we have ``recovered Hamilton's rule as an emergent property of the spatial dynamics'' --- \emph{if} we are willing to draw a circle around the middle of our formula and declare those terms to be the ``relatedness''.
Knowing where our invasion condition came from, we can appreciate some of the caveats which scientists have raised in connection with Hamilton's rule.
\begin{description}
\item[\hyperlink{Simon2012}{Simon \emph{et al.} (2012)}:] In particular, $r$ is often taken to be the average relatedness of interacting individuals, as compared to the average relatedness in the population, in which case inequality (1) $[r B \gt C]$ is referred to as Hamilton's rule. It is important to note that inequality (1) is only a description of whether the current level of assortment as subsumed in the parameter $r$ is sufficient to favour cooperation, but not a description of the mechanisms that would lead to such assortment. It has been suggested repeatedly that the problem of cooperation can be understood entirely based on Hamilton's rules of the form (1). Even though often taken as gospel, this claim is wrong in general, for two reasons.
First, and foremost, even if a rule of the form (1) predicts the direction of selection for cooperation at a given point in time, the long-term evolution of cooperation cannot be understood without having a dynamic equation for the quantity $r$, i.e., without understanding the temporal dynamics of assortment. The dynamics of $r$ in turn cannot be understood based solely on the current level of cooperation, and hence expressions of type (1) are in general insufficient to describe the evolutionary dynamics of cooperation. Second, the quantity $r$, which measures the average relatedness among interacting individuals, is insufficient to construct Hamilton's rule in models that account for variable individual-level death rates and/or group-level events.
\item[\hyperlink{Damore2012}{Damore and Gore (2012)} have more to say on this point:] Contrary to the popular use of the word, ``relatedness'' describes a population of interacting individuals, where $r$ refers to how assorted similar individuals are in the population.
\item[And in more detail:] every definition of relatedness must take into account the population. Therefore, relatedness is not the percent of genome shared, genetic distance, or any extent of similarity between two isolated individuals in a larger population. Also, because horizontal gene transfer is commonplace between microbes and selection is strong, phylogenetic distance or any other indirect genetic measure is likely to be inaccurate. Many of these false definitions live on partly because ambiguous heuristics like ``$\frac{1}{2}$ for brothers, $\frac{1}{8}$ for cousins,'' which require very specific assumptions, are repeated in the primary literature. Also, most non-theoretical papers simply define relatedness as ``a measure of genetic similarity'' and do not elaborate or instead leave the precise definition to the supplemental information $[\ldots]$ Unfortunately, scientists can easily misinterpret this ``measure of genetic similarity'' to be anything that is empirically convenient such as genetic distance or percent of genome shared. Largely because of this confusion, we support the more widespread use of the term ``assortment,'' which is harder to misinterpret $[\ldots]$ For similar reasons of reader understanding, we also encourage authors to make calculations more explicit, either in the main or supplemental text, and to avoid repeating previous results without giving the assumptions that went into deriving them.
\end{description}
It is for this reason that we called $\phi \tilde{q}_{A | A}$ a measure of ``assortment'' earlier. Of course, even with this careful choice of terminology, the limitations of our Hamilton-esque rule still apply: we know that because we derived it from the condition that the dominant eigenvalue be positive, it will miss any effects which a fixed-point eigenvalue analysis is not sensitive to.
\hypertarget{envoi}{}\subsubsection*{{Envoi}}\label{envoi}
Stepping back for a moment, notice that although the terms and coefficients started to proliferate on us, we haven't introduced any remarkably ``advanced'' or ``esoteric'' mathematics. Derivatives, matrices, eigenvalues --- this is \emph{undergraduate} stuff! The amount of algebra we've been able to stir up without really even trying is, however, a little worrying. We can \emph{invent} a mathematical model for some particular biological scenario, and we might even be able to solve it, or at least tell how it'll behave in certain interesting circumstances. But what if we want \emph{general} results which extend across models, or ideas which will help us identify the common features and the key disparities among a host of examples?
With that attitude, then, a thought towards ``higher'' mathematics:
A [[Petri net]] specifies a \href{http://ncatlab.org/nlab/show/symmetric+monoidal+category}{symmetric monoidal category} (\hyperlink{Lerman2011}{Lerman \emph{et al.} 2011}). Each truncation of the moment-dynamics hierarchy for a system yields a Petri net, and so successive truncations of the moment-dynamics hierarchy yield mappings between categories. Going from a pair approximation to a mean-field approximation, for example, transforms a Petri net whose circles are labelled with pair states to one labelled by site states. Category theory might be able to say something interesting here. Anything which can tame the horrible spew of equations which arises in these problems would be great to have. Ought we be considering, say, the \href{http://ncatlab.org/nlab/show/strict+2-category}{strict 2-category} whose objects are moment-closure approximations to an ecosystem, and whose morphisms are \href{http://ncatlab.org/nlab/show/symmetric+monoidal+functor}{symmetric monoidal functors} between them?
\hypertarget{references}{}\subsubsection*{{References}}\label{references}
\begin{itemize}%
\item H. Matsuda, N. Ogita, A. Sasaki, and K. Sato (1992), ``Statistical mechanics of population'', \emph{Progress of Theoretical Physics} \textbf{88,} 6: 1035--49 (\href{http://ptp.ipap.jp/link?PTP/88/1035/}{web}).
\end{itemize}
\begin{itemize}%
\item U. Dieckmann, R. Law, and J. A. J. Metz, eds., \emph{The Geometry of Ecological Interactions: Simplifying Spatial Complexity.} Cambridge University Press, 2000.
\end{itemize}
\begin{itemize}%
\item T. Gross, C. J. Dommar D'Lima and B. Blasius (2006), ``Epidemic dynamics on an adaptive network'', \emph{Physical Review Letters} \textbf{96,} 20: 208701 (\href{http://prl.aps.org/abstract/PRL/v96/i20/e208701}{web}). \href{http://arxiv.org/abs/q-bio/0512037}{arXiv:q-bio/0512037}.
\end{itemize}
\begin{itemize}%
\item P. Bijma and M. J. Wade (2008), ``The joint effects of kin, multilevel selection and indirect genetic effects on response to genetic selection'' \emph{Journal of Evolutionary Biology} \textbf{21:} 1175--88, DOI:10.1111/j.1420-9101.2008.01550.x (\href{http://onlinelibrary.wiley.com/doi/10.1111/j.1420-9101.2008.01550.x/full}{web}).
\end{itemize}
\begin{itemize}%
\item A.-L. Do and T. Gross (2009), ``Contact processes and moment closure on adaptive networks'', in T. Gross and H. Sayama, eds., \emph{Adaptive Networks: Theory, Models and Applications.} Springer.
\end{itemize}
\begin{itemize}%
\item B. Allen (2010), \emph{Studies in the Mathematics of Evolution and Biodiversity.} PhD thesis, Boston University (\href{http://proquest.umi.com/pqdweb?did=2071736811&Fmt=2&clientId=5482&RQT=309&cfc=1}{web}).
\end{itemize}
\begin{itemize}%
\item J. A. Damore and J. Gore (2012), ``Understanding microbial cooperation''. \emph{Journal of Theoretical Biology} \textbf{299:} 31--41, DOI:10.1016/j.jtbi.2011.03.008 (\href{http://gorelab.homestead.com/Papers/UnderstandingMicrobialCooperation.pdf}{pdf}). \href{http://www.ncbi.nlm.nih.gov/pubmed/21419783}{PMID:21419783}.
\end{itemize}
\begin{itemize}%
\item J. Fox (2011), ``\href{http://oikosjournal.wordpress.com/2011/06/29/zombie-ideas-in-ecology-r-and-k-selection/}{Zombie ideas in ecology: \emph{r} and \emph{K} selection}'' \emph{Oikos} blog entry.
\end{itemize}
\begin{itemize}%
\item B. Simon, J. A. Fletcher and M. Doebeli (2012), ``Hamilton's rule in multi-level selection models'' \emph{Journal of Theoretical Biology} \textbf{299:} 55--63 \href{http://www.ncbi.nlm.nih.gov/pubmed/21820447}{PMID:21820447}.
\end{itemize}
\begin{itemize}%
\item B. C. Stacey, A. Gros and Y. Bar-Yam (2014), ``Eco-Evolutionary Feedback in Host--Pathogen Spatial Dynamics'', \href{http://arxiv.org/abs/1110.3845}{arXiv:1110.3845 [nlin.AO]}.
\end{itemize}
\begin{itemize}%
\item J. D. Van Dyken, T. A. Linksvayer and M. J. Wade (2011), ``Kin Selection--Mutation Balance: A Model for the Origin, Maintenance, and Consequences of Social Cheating'' \emph{The American Naturalist} \textbf{177,} 3: 288--300. \href{http://www.jstor.org/stable/10.1086/658365}{JSTOR:10.1086/658365} (\href{http://openwetware.org/images/0/05/Van_Dyken_et_al_2011_Kin_selection-mutation_balance_Am_Nat.pdf}{pdf}).
\end{itemize}
\begin{itemize}%
\item E. Lerman \emph{et al.} (2011), \href{http://johncarlosbaez.wordpress.com/2011/11/12/network-theory-part-17/#comment-10300}{conversation at the \emph{Azimuth} blog}.
\end{itemize}
category: blog
\end{document}