Skip to content

test page for experimenting with the wiki

josef-pkt edited this page Apr 25, 2012 · 2 revisions

[ P(E) = {n choose k} p^k (1-p)^{ n-k} ]

$$\begin{aligned} \\frac{x^5}{2*x + 1} \end{aligned}$$

x5

The CDF is defined as:

$$\begin{aligned} \\exp\left(-\\lambda\\right)\\sum_{i=0}^{y}\\frac{\\lambda^{i}}{i!} \end{aligned}$$

where $\\lambda$ ( lambda ) assumes the loglinear model. I.e.,

$$\begin{aligned} \\ln\\lambda_{i}=X\\beta \end{aligned}$$

The parameter X is $X\\beta$ in the above formula.

math without rst markup see https://github.com/github/gollum

[ y = f(X beta) + epsilon ]

[ E(X_t, epsilon_t) = 0 ]

[ E(epsilon_t, epsilon{t'}) = 0 hspace{3} textbf{for all} hspace{3} t neq t' ]

If we additionally assume that the errors are i.i.d. normal, then ...