7 research outputs found
On martingale tail sums in affine two-color urn models with multiple drawings
In two recent works, Kuba and Mahmoud (arXiv:1503.090691 and
arXiv:1509.09053) introduced the family of two-color affine balanced Polya urn
schemes with multiple drawings. We show that, in large-index urns (urn index
between and ) and triangular urns, the martingale tail sum for the
number of balls of a given color admits both a Gaussian central limit theorem
as well as a law of the iterated logarithm. The laws of the iterated logarithm
are new even in the standard model when only one ball is drawn from the urn in
each step (except for the classical Polya urn model). Finally, we prove that
the martingale limits exhibit densities (bounded under suitable assumptions)
and exponentially decaying tails. Applications are given in the context of node
degrees in random linear recursive trees and random circuits.Comment: 17 page
On martingale tail sums for the path length in random trees
For a martingale converging almost surely to a random variable ,
the sequence is called martingale tail sum. Recently, Neininger
[Random Structures Algorithms, 46 (2015), 346-361] proved a central limit
theorem for the martingale tail sum of R{\'e}gnier's martingale for the path
length in random binary search trees. Gr{\"u}bel and Kabluchko [to appear in
Annals of Applied Probability, (2016), arXiv 1410.0469] gave an alternative
proof also conjecturing a corresponding law of the iterated logarithm. We prove
the central limit theorem with convergence of higher moments and the law of the
iterated logarithm for a family of trees containing binary search trees,
recursive trees and plane-oriented recursive trees.Comment: Results generalized to broader tree model; convergence of moments in
the CL
Refined asymptotics for the number of leaves of random point quadtrees
In the early 2000s, several phase change results from distributional convergence to distributional non-convergence have been obtained for shape parameters of random discrete structures. Recently, for those random structures which admit a natural martingale process, these results have been considerably improved by obtaining refined asymptotics for the limit behavior. In this work, we propose a new approach which is also applicable to random discrete structures which do not admit a natural martingale process. As an example, we obtain refined asymptotics for the number of leaves in random point quadtrees. More applications, for example to shape parameters in generalized m-ary search trees and random gridtrees, will be discussed in the journal version of this extended abstract