BM 20160210

Thu May 12 22:41:17 CDT 2016 2659296c74bcec23c5dec54ac227ebf4d09dd60a

Markov tree, obsolete

• Starting from root \(\{Y_1 = 0, Y_2 = 0, \ldots, Y_K = 0\}_{K}\)
• Simulate Markov process of binary conversion of \(Y_k\) (continuous time Jukes-Cantor) \[ Q = \begin{bmatrix} 1 - \alpha & \alpha \\ \alpha & 1 - \alpha \end{bmatrix} ;\quad P = \exp(Qt) \]
• Repeat \(N\) times such that each node will have \(N\) “draws”

Simulation default setup:

• \(N = 100, K=100, t = 0.02, \alpha = 0.01\)