\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*{Blog - network theory (part 7)}
This page is a [[Blog articles in progress|blog article in progress]], written by [[Jacob Biamonte]]. To see a discussion of this article while it was being written, \href{http://www.math.ntnu.no/~stacey/Mathforge/Azimuth/comments.php?DiscussionID=623&Focus=3867#Comment_3867}{visit the Azimuth Forum}. For the final polished version, \href{http://johncarlosbaez.wordpress.com/2011/04/27/network-theory-part-7/}{go to the Azimuth Blog}.
\emph{guest post by \textbf{[[Jacob Biamonte]]}}
This post is part of a series on what John and I like to call . Stochastic Petri nets can be used to model everything from vending machines to chemical reactions. Chemists have proven some powerful theorems about when these systems have equilibrium states. We're trying to bind these old ideas into our fancy framework, in hopes that quantum field theory techniques could also be useful in this deep subject. We'll describe the general theory later; today we'll do an example from population biology.
Those of you following this should know that I'm the calculation bunny for this project, with John playing the role of the wolf. If I don't work quickly, drawing diagrams and trying to keep up with John's space-bending quasar of information, I'll be eaten alive! It's no joke, so please try to respond and pretend to enjoy anything you read here. This will keep me alive for longer. If I did not take notes during our meetings, lots of this stuff would have never made it here, so hope you enjoy.
Here's a stochastic Petri net:
It shows a world with one state, , and two transitions:
$\bullet$ , where one amoeba turns into two. Let's call the rate constant for this transition $\alpha$.
$\bullet$ , where two amoebas battle for resources and only one survives. Let's call the rate constant for this transition $\beta$.
We are going to analyse this example in several ways. First we'll study the dynamics it describes: we'll look at its rate equation, which turns out to be the , familiar in population biology. Then we'll study the dynamics, meaning its master equation. That's where the ideas from quantum field theory come in.
If $P(t)$ is the population of amoebas at time $t$, we can follow the rules explained in and crank out this :
\begin{displaymath}
\frac{d P}{d t} = \alpha P - \beta P^2
\end{displaymath}
We can rewrite this as
\begin{displaymath}
\frac{d P }{d t}= k P(1-\frac{P}{Q})
\end{displaymath}
where
\begin{displaymath}
Q = \frac{\alpha}{\beta} , \qquad k = \alpha
\end{displaymath}
What's the meaning of $Q$ and $k$?
$\bullet$ $Q$ is the , that is, the maximum sustainable population the environment can support.
$\bullet$ $k$ is the describing the approximately exponential growth of population when $P(t)$ is small.
It's a rare treat to find such an important differential equation that can be solved by analytical methods. Let's enjoy solving it.
We start by separating variables and integrating both sides:
\begin{displaymath}
\int \frac{d P}{P (1-P/Q)} = \int k d t
\end{displaymath}
We need to use partial fractions on the left side above, resulting in
\begin{displaymath}
\int \frac{d P}{P} + \int \frac{d P}{Q-P} = \int k d t
\end{displaymath}
and so we pick up a constant $C$, let $A=\pm e^{-C}$, and rearrange things as
\begin{displaymath}
\frac{Q-P}{P}=A e^{-k t}
\end{displaymath}
and the population as a function of time becomes
\begin{displaymath}
P(t) = \frac{Q}{1+A e^{-k t}}
\end{displaymath}
At $t=0$ we can determine $A$ uniquely. We write $P_0 := P(0)$ and $A$ becomes
\begin{displaymath}
A = \frac{Q-P_0}{P_0}
\end{displaymath}
The model now becomes very intuitive. Let's set $Q = k=1$ and make a plot for various values of $A$:
We arrive at three distinct cases:
$\bullet$ ($A=0$). The horizontal blue line corresponds to the case where the initial population $P_0$ exactly equals the carrying capacity. In this case the population is constant.
$\bullet$ ($A \lt 0$). The three decaying curves above the horizontal blue line correspond to cases where initial population is higher than the carrying capacity. The population dies off over time and approaches the carrying capacity.
$\bullet$ ($A \gt 0$). The four increasing curves below the horizontal blue line represent cases where the initial population is lower than the carrying capacity. Now the population grows over time and approaches the carrying capacity.
Next, let us follow the rules explained in to write down the master equation for our example. Remember, now we write:
\begin{displaymath}
\Psi(t) = \sum_{n = 0} \psi_n(t) z^n
\end{displaymath}
where $\psi_n(t)$ is the probability of having $n$ amoebas at time $t$, and $z$ is a formal variable. The says
\begin{displaymath}
\frac{d}{d t} \Psi(t) = H \Psi(t)
\end{displaymath}
where $H$ is an operator on formal power series called the . To get the Hamiltonian we take each transition in our Petri net and build an operator built from creation and annihilation operators, as follows. Reproduction works like this:
while competition works like this:
Here $a$ is the annihilation operator, $a^\dagger$ is the creation operator and $N = a^\dagger a$ is the number operator. John explained precisely how the $N$`s arise. So the theory is already in place, and we arrive at this Hamiltonian:
\begin{displaymath}
H = \alpha (a^\dagger a^\dagger a - N) \;\; + \;\; \beta(a^\dagger a a - N(N-1))
\end{displaymath}
Remember, $\alpha$ is the rate constant for reproduction, while $\beta$ is the rate constant for competition.
The master equation can be solved: it's equivalent to $\frac{d}{d t}(e^{-t H}\Psi(t))=0$ so that $e^{-t H}\Psi(t)$ is constant, and so
\begin{displaymath}
\Psi(t) = e^{t H}\Psi(0)
\end{displaymath}
and that's it! We can calculate the time evolution starting from any initial probability distribution of populations. Maybe everyone is already used to this, but I find it rather remarkable.
Here's how it works. We pick a population, say $n$ amoebas at $t=0$. This would mean $\Psi(0) = z^n$. We then evolve this state using $e^{t H}$. We will expand this operator as
\begin{displaymath}
\begin{aligned} e^{t H} &=& \sum_{n=0} \frac{1}{n!} H^n t^n
\\
\\
&=& 1 + t H + \frac{1}{2}t^2 H^n + \cdots \end{aligned}
\end{displaymath}
This operator contains the full information for the evolution of the system. It contains the of all possible amoeba populations---an amoeba mosaic if you will. From this, we can construct amoeba Feynman diagrams.
To do this, we work out each of the $H^n$ terms in the expansion above. The first-order terms correspond to the Hamiltonian acting once. These are proportional to either $\alpha$ or $\beta$. The second-order terms correspond to the Hamiltonian acting twice. These are proportional to either $\alpha^2$, $\alpha\beta$ or $\beta^2$. And so on.
This is where things start to get interesting! We will consider two possibilities for the second-order terms:
1) A lone amoeba ($\Psi(0) = z$) reproduces and splits into two. In the battle of the century, the resulting amoebas compete and one dies. At the end we have:
\begin{displaymath}
\frac{\alpha \beta}{2} (a^\dagger a a)(a^\dagger a^\dagger a) z
\end{displaymath}
We can draw this as a Feynman diagram:
You might find this tale grim, and you may not like the odds either. It's true, the odds could be better, but people are worse off than amoebas! The great Japanese swordsman quoted the survival odds of fair sword duels as 1/3, seeing that 1/3 of the time both participants die. A remedy is to cheat, but these amoeba are competing .
2) We start with two amoebas, so the initial state is $\Psi(0) = z^2$. One of these amoebas splits into two. One of these then gets into an argument with the original amoeba over the Azimuth blog. The amoeba who solved all John's puzzles survived. At the end we have
\begin{displaymath}
\frac{\alpha \beta}{2} (a^\dagger a a)(a^\dagger a^\dagger a) z^2
\end{displaymath}
with corresponding Feynman diagram:
This should give an idea of how this all works. The exponential of the Hamiltonian gives all possible histories, and each of these can be translated into a Feynman diagram. In a future blog entry, we might explain this theory in detail.
We've seen the equilibrium solution for the rate equation; now let's look for equilibrium solutions of the master equation. This paper:
$\bullet$ D. F. Anderson, G. Craciun and T.G. Kurtz, , arXiv:0803.3042.
proves that for a large class of stochastic Petri nets, there exists an equilibrium solution of the master equation where the number of things in each state is distributed according to a . Even more remarkably, these probability distributions are , so knowing how many things are in one state tells you nothing about how many are in another!
Here's a nice quote from this paper:
\begin{quote}%
The surprising aspect of the deficiency zero theorem is that the assumptions of the theorem are completely related to the network of the system whereas the conclusions of the theorem are related to the dynamical properties of the system.
\end{quote}
The `deficiency zero theorem' is a result of , which says that for a large class of stochastic Petri nets, the rate equation has a unique equilibrium solution. Anderson, Craciun and Kurtz showed how to use this fact to get equilibrium solutions of the master equation!
We will consider this in future posts. For now, we need to talk a bit about .
These are all over the place in quantum theory. Legend (or at least Wikipedia) has it that Erwin SchrÃ¶dinger himself discovered coherent states when he was looking for states of a quantum system that look `as classical as possible'. Suppose you have a quantum harmonic oscillator. Then the says that
\begin{displaymath}
\Delta p \Delta q \ge \hbar/2
\end{displaymath}
where $\Delta p$ is the uncertainty in the momentum and $\Delta q$ is the uncertainty in position. Suppose we want to make $\Delta p \Delta q$ as small as possible, and suppose we also want $\Delta p = \Delta q$. Then we need our particle to be in a `coherent state'. That's the definition. For the quantum harmonic oscillator, there's a way to write quantum states as formal power series
\begin{displaymath}
\Psi = \sum_{n = 0} \psi_n z^n
\end{displaymath}
where $\psi_n$ is the amplitude for having $n$ quanta of energy. A coherent state then looks like this:
\begin{displaymath}
\Psi = e^{c z} = \sum_{n = 0} \frac{c^n}{n!} z^n
\end{displaymath}
where $c$ can be any complex number. Here we have omitted a constant factor necessary to normalize the state.
We can also use coherent states in classical stochastic systems like collections of amoebas! Now the coefficient of $z^n$ tells us the probability of having $n$ amoebas, so $c$ had better be real. And probabilities should sum to 1, so we really should normalize $\Psi$ as follows:
\begin{displaymath}
\Psi = \frac{e^{c z}}{e^c} = e^{-c} \sum_{n = 0} \frac{c^n}{n!} z^n
\end{displaymath}
Now, the probability distribution
\begin{displaymath}
\psi_n = e^{-c} \frac{c^n}{n!}
\end{displaymath}
is called . So, for starters you can think of a `coherent state' as an over-educated way of talking about a Poisson distribution.
Let's work out the expected number of amoebas in this Poisson distribution. In the answers to the puzzles in , we started using this abbreviation
\begin{displaymath}
\sum \Psi = \sum_{n = 0}^\infty \psi_n
\end{displaymath}
We also saw that the expected number of amoebas in the probability distribution $\Psi$ is
\begin{displaymath}
\sum N \Psi
\end{displaymath}
What does this equal? Remember that $N = a^\dagger a$. The annihilation operator $a$ is just $\frac{d}{d z}$, so
\begin{displaymath}
a \Psi = c \Psi
\end{displaymath}
and we get
\begin{displaymath}
\sum N \Psi = \sum a^\dagger a \Psi = c \sum a^\dagger \Psi
\end{displaymath}
But we saw in that $a^\dagger$ is stochastic, meaning
\begin{displaymath}
\sum a^\dagger \Psi = \sum \Psi
\end{displaymath}
for any $\Psi$. Furthermore, our $\Psi$ here has
\begin{displaymath}
\sum \Psi = 1
\end{displaymath}
since it's a probability distribution. So:
\begin{displaymath}
\sum N \Psi = c \sum a^\dagger \Psi = c \sum \Psi = c
\end{displaymath}
The expected number of amoebas is just $c$!
Puzzle 1. This calculation must be wrong if $c$ is negative: there can't be a negative number of amoebas. What goes wrong then?
Puzzle 2. Use the same tricks to calculate the standard deviation of the number of amoebas in the Poisson distribution $\Psi$.
Now let's return to our problem and consider the initial amoeba state
\begin{displaymath}
\Psi = e^{c z}
\end{displaymath}
Here aren't bothering to normalize it, because we're going to look for equilibrium solutions to the master equation, meaning solutions where $\Psi(t)$ doesn't change with time. So, we want to solve
\begin{displaymath}
H \Psi = 0
\end{displaymath}
Since this equation is linear, the normalization of $\Psi$ doesn't really matter.
Remember,
\begin{displaymath}
H\Psi = \alpha (a^\dagger a^\dagger a - N)\Psi + \beta(a^\dagger a a - N(N-1)) \Psi
\end{displaymath}
Let's work this out. First consider the two $\alpha$ terms:
\begin{displaymath}
a^\dagger a^\dagger a \Psi = c z^2 \Psi
\end{displaymath}
and
\begin{displaymath}
-N \Psi = -a^\dagger a\Psi = -c z \Psi
\end{displaymath}
Likewise for the $\beta$ terms we find
\begin{displaymath}
a^\dagger a a\Psi=c^2 z \Psi
\end{displaymath}
and
\begin{displaymath}
-N(N-1)\psi = -a^\dagger a^\dagger a a \Psi = -c^2 z^2\Psi
\end{displaymath}
Here I'm using something John showed in : the product ${a^\dagger}^2 a^2$ equals the `falling power' $N(N-1)$.
The sum of all four terms must vanish. This happens whenever
\begin{displaymath}
\alpha(c z^2 - c z)+\beta(c^2 z-c^2 z^2) = 0
\end{displaymath}
which is satisfied for
\begin{displaymath}
c= \frac{\alpha}{\beta}
\end{displaymath}
Yipee! We've found an equilibrium solution, since we found a value for $c$ that makes $H \Psi = 0$. Even better, we've seen that the expected number of amoebas in this equilibrium state is
\begin{displaymath}
\frac{\alpha}{\beta}
\end{displaymath}
This is just the same as the equilibrium population we saw in the ---that is, the logistic equation! That's pretty cool, but it's no coincidence: in fact, Anderson proved it works like this for lots of stochastic Petri nets.
I'm not sure what's up next or what's in store, since I'm blogging at gun point from inside a rabbit cage.
I'd imagine we're going to work out the theory behind this example and prove the existence of equilibrium solutions in master equations more generally. One idea John had was to have me start a night shift---that way you'll get Azimuth posts 24 hours a day.
category: blog
\end{document}