en>Teika kazura: /* Bibliography */ Phase Transitions and Critical Phenomena

2013-05-11T11:54:34Z

Bibliography: Phase Transitions and Critical Phenomena

← Older revision		Revision as of 13:54, 11 May 2013
Line 1:		Line 1:
	~~Roberto~~ is the ~~name I just love~~ to be ~~recognized~~ with ~~though~~ [~~http:~~/~~/Www~~.~~Google~~.Co.~~uk/search?hl~~=en&gl=us&~~tbm=nws~~&q=~~I+won%27t&gs_l~~=~~news I won~~'t] ~~really like being known like~~ that. ~~My visitors say it~~'~~s not superior~~ for me but the ~~I love doing~~ can be to ~~bake but I~~'m ~~so thinking on starting something mroe challenging~~. ~~South Carolina~~ is ~~where simple home~~ is. ~~Software developing~~ is ~~how As well as [http~~://~~www~~.~~Dict~~.cc/?s=~~support support~~] ~~my family~~. ~~You~~ can ~~seek out my website here~~: ~~http~~://~~prometeu.net~~<br><br>~~Here~~ is ~~my site~~ ... [http://~~prometeu~~.~~net astuces clash~~ of ~~clans~~]		In [[probability theory]], a '''branching process''' is a [[Markov process]] that models a population in which each individual in generation ''n'' produces some random number of individuals in generation ''n'' + 1, according, in the simplest case, to a fixed [[probability distribution]] that does not vary from individual to individual.<ref>{{cite doi\|10.1002/9780470057339.vab032}}</ref> Branching processes are used to model reproduction; for example, the individuals might correspond to bacteria, each of which generates 0, 1, or 2 offspring with some probability in a single time unit. Branching processes can also be used to model other systems with similar dynamics, e.g., the spread of [[surname]]s in [[genealogy]] or the propagation of neutrons in a [[nuclear reactor]].

			A central question in the theory of branching processes is the probability of '''ultimate extinction''', where no individuals exist after some finite number of generations. It is not hard to show that, starting with one individual in generation zero, the [[expected value\|expected]] size of generation ''n'' equals μ<sup>''n''</sup> where μ is the expected number of children of each individual. If μ < 1, then the expected number of individuals goes rapidly to zero, which implies ultimate extinction [[with probability 1]] by [[Markov's inequality]]. Alternatively, if μ > 1, then the probability of ultimate extinction is less than 1 (but not necessarily zero; consider a process where each individual either dies without issue or has 100 children with equal probability). If μ = 1, then ultimate extinction occurs with probability 1 unless each individual always has exactly one child.

			In [[theoretical ecology]], the parameter μ of a branching process is called the [[basic reproductive rate]].

			== Mathematical formulation ==

			The most common formulation of a branching process is that of the [[Galton–Watson process]]. Let ''Z''<sub>''n''</sub> denote the state in period ''n'' (often interpreted as the size of generation ''n''), and let ''X''<sub>''n,i''</sub> be a random variable denoting the number of direct successors of member ''i'' in period ''n'', where ''X''<sub>''n,i''</sub> are [[independent and identically distributed random variables]] over all ''n'' ∈ 0, 1, 2, ...} and ''i'' ∈ {1, ..., ''Z''<sub>''n''</sub>}. Then the recurrence equation is

			:<math>Z_{n+1} = \sum_{i=1}^{Z_n} X_{n,i}</math>

			with ''Z''<sub>0</sub> = 1. Alternatively, one can formulate a branching process as a [[random walk]]. Let ''S''<sub>''i''</sub> denote the state in period ''i'', and let ''X''<sub>''i''</sub> be a random variable that is iid over all ''i''. Then the recurrence equation is

			:<math>S_{i+1} = S_i+X_{i+1}-1 = \sum_{j=1}^{i+1} X_j-i</math>

			with ''S''<sub>0</sub> = 1. To gain some intuition for this formulation, one can imagine a walk where the goal is to visit every node, but every time a previously unvisited node is visited, additional nodes are revealed that must also be visited. Let ''S''<sub>''i''</sub> represent the number of revealed but unvisited nodes in period ''i'', and let ''X''<sub>''i''</sub> represent the number of new nodes that are revealed when node ''i'' is visited. Then in each period, the number of revealed but unvisited nodes equals the number of such nodes in the previous period, plus the new nodes that are revealed when visiting a node, minus the node that is visited. The process ends once all revealed nodes have been visited.

			== Extinction problem ==
			The ultimate extinction probability is given by

			:<math>\lim_{n \to \infty} \Pr(Z_n=0).</math>

			For any nontrivial cases (trivial cases are ones in which the probability of having no offspring is zero for every member of the population - in such cases the probability of ultimate extinction is 0), the probability of ultimate extinction equals one if ''μ'' ≤ 1 and strictly less than one if ''μ'' > 1.

			The process can be analyzed using the method of [[probability generating function]]. Let ''p''<sub>0</sub>, ''p''<sub>1</sub>, ''p''<sub>2</sub>, ... are the probabilities of producing 0, 1, 2, ... offspring by each individual in each generation. Let ''d''<sub>''m''</sub> be the extinction probability by the mth generation. Obviously, ''d''<sub>0</sub>= 0. Since the probabilities for all paths that lead to 0 by the ''m''-th generation must be added up, the extinction probability is nondecreasing in generations. That is,

			:<math>0=d_0 \leq d_1\leq d_2 \leq \cdots \leq 1.</math>

			Therefore, ''d''<sub>''m''</sub> converges to a limit d, and d is the ultimate extinction probability. If there are j offspring in the first generation, then to die out by the mth generation, each of these lines must die out in m-1 generations. Since they proceed independently, the probability is (''d''<sub>''m−1''</sub>)<sup>''j''</sup>. Thus,

			:<math>d_m=p_0+p_1d_{m-1}+p_2(d_{m-1})^2+p_3(d_{m-1})^3+\cdots. \, </math>

			The right-hand side of the equation is probability generating function. Let ''h''(''z'') be the ordinary generating function for ''p''<sub>''i''</sub>:

			:<math>h(z)=p_0+p_1z+p_2z^2+\cdots. \, </math>

			Using the generating function, the previous equation becomes

			:<math>d_m=h(d_{m-1}). \, </math>

			Since ''d''<sub>''m''</sub> → ''d'', ''d'' can be found by solving

			:<math>d=h(d). \, </math>

			This is also equivalent to find the intersection point(s) of lines ''y'' = ''z'' and ''y'' = ''h''(''z'') for ''z'' ≥ 0. ''y'' = ''z'' is a straight line. ''y'' = ''h''(''z'') is an increasing (''h''(''z'') = ''p''<sub>1</sub> + 2''p''<sub>2</sub>''z'' + 3''p''<sub>3</sub>''z''<sup>2</sup> + ... ≥ 0) and convex (''h''(''z'') = 2''p''<sub>2</sub> + 6''p''<sub>3</sub>z + 12''p''<sub>4</sub>''z''<sup>2</sup> + ... ≥ 0) function. There are at most two intersection points. Since (1,1) is always an intersect point for the two functions, there only exist three cases:[[File:Hgraph.png\|thumb\|Three cases of ''y'' = ''h''(''z'') intersect with ''y'' = ''z''.]]

			Case 1 has another intersect point at ''z'' < 1 (see the red curve in the graph).

			Case 2 has only one intersect point at ''z'' = 1.(See the green curve in the graph)

			Case 3 has another intersect point at ''z'' > 1.(See the black curve in the graph)

			In case 1, the ultimate extinction probability is strictly less than one. For case 2 and 3, the ultimate extinction probability equals to one.

			By observing that ''h′''(1) = ''p''<sub>1</sub> + 2''p''<sub>2</sub> + 3''p''<sub>3</sub> + ... = ''μ'' is exactly the expected number of offspring a parent could produce, it can be concluded that for a branching process with generating function ''h''(''z'') for the number of offspring of a given parent, if the mean number of offspring produced by a single parent is less than or equal to one, then the ultimate extinction probability is one. If the mean number of offspring produced by a single parent is greater than one, then the ultimate extinction probability is strictly less than one.

			== Example of extinction problem ==
			Consider a parent can produce at most two offspring and the probabilities for the number produced are ''p''<sub>0</sub> = 0.1, ''p''<sub>1</sub> = 0.6, and ''p''<sub>2</sub> = 0.3. The extinction probability in each generation is

			:<math>d_m=p_0+p_1d_{m-1}+p_2(d_{m-1})^2. \, </math>

			with ''d''<sub>0</sub> = 0. Here, the extinction probability is calculated from generation 1 to generation 20. The result is shown in the table.
			[[File:Extinction table.png\|thumb\|The extinction probability converges to the ultimate extinction probability as time goes.]]

			For the ultimate extinction probability, we need to find d which satisfies ''d'' = ''p''<sub>0</sub> + ''p''<sub>1</sub>d + ''p''<sub>2</sub>''d''<sup>2</sup>. In this example, ''d'' = 1/3. This is exactly what the probabilities in the table converges to.

			==See also==
			* [[Galton–Watson process]]
			* [[Random tree]]
			* [[Branching random walk]]
			* [[Martingale (probability theory)]]

			==References==

			{{Reflist}}
			* C. M. Grinstead and J. L. Snell, [http://www.dartmouth.edu/~chance/teaching_aids/books_articles/probability_book/book.html Introduction to Probability], 2nd ed. Section 10.3 discusses branching processes in detail together with the application of generating functions to study them.
			* G. R. Grimmett and D. R. Stirzaker, ''Probability and Random Processes'', 2nd ed., Clarendon Press, Oxford, 1992. Section 5.4 discusses the model of branching processes described above. Section 5.5 discusses a more general model of branching processes known as '''age-dependent branching processes''', in which individuals live for more than one generation.

			{{Stochastic processes}}

			{{DEFAULTSORT:Branching Process}}
			[[Category:Stochastic processes]]

en>Helpful Pixie Bot: ISBNs (Build KH)

2012-05-11T22:29:33Z

ISBNs (Build KH)

New page

Roberto is the name I just love to be recognized with though [http://Www.Google.Co.uk/search?hl=en&gl=us&tbm=nws&q=I+won%27t&gs_l=news I won't] really like being known like that. My visitors say it's not superior for me but the I love doing can be to bake but I'm so thinking on starting something mroe challenging. South Carolina is where simple home is. Software developing is how As well as [http://www.Dict.cc/?s=support support] my family. You can seek out my website here: http://prometeu.net<br><br>Here is my site ... [http://prometeu.net astuces clash of clans]

Critical phenomena - Revision history

en>Teika kazura: /* Bibliography */ Phase Transitions and Critical Phenomena

en>Helpful Pixie Bot: ISBNs (Build KH)