

























Due to the popularity of randomly evolving graph processes, there exists a randomized version of many recursively defined graph models. This is also the case with the cherry tree, which was introduced by Bukszár and Prékopa to improve Bonferroni type upper bounds on the probability of the union of random events. Here we consider a substantially extended random analogue of that model, embedding it into a general time dependent branching process.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。