08.10.2016 Views

Foundations of Data Science

2dLYwbK

2dLYwbK

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Theorem 4.11 Consider a tree generated by a branching process. Let f(x) be the generating<br />

function for the number <strong>of</strong> children at each node.<br />

1. If the expected number <strong>of</strong> children at each node is less than or equal to one, then the<br />

probability <strong>of</strong> extinction is one unless the probability <strong>of</strong> exactly one child is one.<br />

2. If the expected number <strong>of</strong> children <strong>of</strong> each node is greater than one, then the probability<br />

<strong>of</strong> extinction is the unique solution to f(x) = x in [0, 1).<br />

Pro<strong>of</strong>: Let p i be the probability <strong>of</strong> i children at each node. Then f(x) = p 0 + p 1 x +<br />

p 2 x 2 + · · · is the generating function for the number <strong>of</strong> children at each node and f ′ (1) =<br />

p 1 + 2p 2 + 3p 3 + · · · is the slope <strong>of</strong> f(x) at x = 1. Observe that f ′ (1) is the expected<br />

number <strong>of</strong> children at each node.<br />

Since the expected number <strong>of</strong> children at each node is the slope <strong>of</strong> f(x) at x = 1, if<br />

the expected number <strong>of</strong> children is less than or equal to one, the slope <strong>of</strong> f(x) at x = 1<br />

is less than or equal to one and the unique root <strong>of</strong> f(x) = x in (0, 1] is at x = 1 and the<br />

probability <strong>of</strong> extinction is one unless f ′ (1) = 1 and p 1 = 1. If f ′ (1) = 1 and p 1 = 1,<br />

f(x) = x and the tree is an infinite degree one chain. If the slope <strong>of</strong> f(x) at x = 1 is<br />

greater than one, then the probability <strong>of</strong> extinction is the unique solution to f(x) = x in<br />

[0, 1).<br />

A branching process with m 1, then the branching process will die out with some probability less than one unless<br />

p 0 = 0 in which case it cannot die out, since a node always has at least one descendent.<br />

Note that the branching process corresponds to finding the size <strong>of</strong> a component in<br />

an infinite graph. In a finite graph, the probability distribution <strong>of</strong> descendants is not a<br />

constant as more and more vertices <strong>of</strong> the graph get discovered.<br />

The simple branching process defined here either dies out or goes to infinity. In biological<br />

systems there are other factors, since processes <strong>of</strong>ten go to stable populations. One<br />

possibility is that the probability distribution for the number <strong>of</strong> descendants <strong>of</strong> a child<br />

depends on the total population <strong>of</strong> the current generation.<br />

Expected size <strong>of</strong> extinct families<br />

We now show that the expected size <strong>of</strong> an extinct family is finite, provided that m ≠ 1.<br />

Note that at extinction, the size must be finite. However, the expected size at extinction<br />

could conceivably be infinite, if the probability <strong>of</strong> dying out did not decay fast enough.<br />

To see how the expected value <strong>of</strong> a random variable that is always finite could be infinite,<br />

let x be an integer valued random variable. Let p i be the probability that x = i. If<br />

∞∑<br />

p i = 1, then with probability one, x will be finite. However, the expected value <strong>of</strong> x<br />

i=1<br />

100

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!