So you have X_1, X_2, ... random variables with the same distribution. And N discrete, positive, integer random variable with X_i \perp N
Let us compute S = \sum_{i = 1}^N X_i
Theorem: Let X_1, X_2, ... be i.i.d. (Independent and identically distributed) random variables, where X_i \sim X. Let S = \sum_{i = 1}^N X_i where N \perp X_i, then:
We have time t = 0, 1, 2, 3..., and start from a node. On each step, with probability \frac{1}{2}, a leaf will stay inert, with probability \frac{1}{2}, a leaf will split to 2.
Define X_t = \text{number of leaves in time} = t, then we see:
Stochastically Dominate: X stochastically dominates Y (write as X \geq_{st} Y) if (\forall i)(Pr\{X > i\} \geq Pr\{Y > i\})
Jensen's Inequality
E[X^2] \geq E[X]^2
E[X^s] \geq E[X]^s (\text{for integer } x \geq 2)
Definition of convex function: (all point on convex function sit above a line that pass through it) A real-valued function g(x) on interval S \subseteq \mathbb{R} is convex on S if:
g(t) = at + b
(\forall x \in S)(g(x) \geq y(x) \equiv ax + b) where the line y(x) = ax + b is called a supporting line for the function g at t.
Theorem: Let X be a random variable that takes on values in an interval S and let g : S \rightarrow \mathbb{R} be a convex function on S, then E[g(X)] \geq g(E[X])