Take a continuous-time Galton-Watson tree. If the system survives until a large time T , then choose k particles uniformly from those alive. What does the ancestral tree drawn out by these k particles look like? Some special...
Take a continuous-time Galton-Watson tree. If the system survives until a large time T , then choose k particles uniformly from those alive. What does the ancestral tree drawn out by these k particles look like? Some special...
We define a new probability distribution for Boolean functions of k variables. Consider the random Binary Search Tree of size n, and label its internal nodes by connectives and its leaves by variables or their negations. This...
|< |
< |
1 |