Large Deviation Rates for Branching Processes--I. Single Type Case
暂无分享,去创建一个
Besides being of some interest in its own right, this seems to be of some importance in algorithmic tree structures in computer science (see [6] and [8]). In [6] it is mentioned that the execution of a canonical algorithm for evaluating uniform AND/OR trees in some probabilistic models can be viewed as a branching process. The probability that the running time of this algorithm deviates from its expected value corresponds to the tail probabilities and large deviations associated with branching processes. Also, from a statistical inference point of view the first quantity above is of some interest
[1] N. H. Bingham,et al. On the limit of a supercritical branching process , 1988, Journal of Applied Probability.
[2] Anand N. Vidyashankar,et al. Large deviation results for branching processes in fixed and random environments , 1994 .
[3] Joseph A. O'Sullivan,et al. Entropies and combinatorics of random branching processes and context-free languages , 1992, IEEE Trans. Inf. Theory.
[4] J. Biggins,et al. Some divisibility problems in branching processes , 1981, Mathematical Proceedings of the Cambridge Philosophical Society.