We consider a multivariate distributional recursion of sum type, as arises in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's ...
This is a preview. Log in through your library . Abstract A scale-free tree with the parameter β is very close to a star if β is just a bit larger than — 1, whereas it is close to a random recursive ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback