Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
This would be right except that it is not necessarily true that $S_M=0$ on the event $X_1 > 0$. If $p=2/3$, for example, then $X$ takes values $-1$ and $1/2$, So $S_M$ can take the value $-1/2$.
Yes I see now. Sorry for being confused! Actually this is already an interesting question in the discrete case. Does there exist a sequence $(X_n)_{n \in \mathbb{N}}$ of random variables with $X_{j+1} + \ldots +X_{j+n}$ having Binomial$(n,1/2)$ distribution for all $j$ and $n$, which is not simply a sequence of independent binomial random variables?
With probability one, for every pair $0 < p < q$, $p,q$ rationals, $X(q)-X(p)$ is a non-negative integer. Since $X$ is cadlag the same property must hold for every real pair $0 < s < t$, i.e. $X$ is increasing and integer-valued, so it is a point process.
For generalizations it's useful to be able to take either perspective: (A) and (B) as a single "niceness" condition; or, separate them and try to relax them separately.
Ori, yes, my suggestion was ill-thought-out. I guess breadth-first search always gives an upper-bound that is of the order of the greatest number of nodes in any single generation. This is roughly tight for a complete binary tree but not in general.