Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Sulzbach, Henning"'
We study a general model of random dynamical simplicial complexes and derive a formula for the asymptotic degree distribution. This asymptotic formula encompasses results for a number of existing models, including random Apollonian networks and the w
Externí odkaz:
http://arxiv.org/abs/1910.12715
Autor:
Broutin, Nicolas, Sulzbach, Henning
We consider the cost of general orthogonal range queries in random quadtrees. The cost of a given query is encoded into a (random) function of four variables which characterize the coordinates of two opposite corners of the query rectangle. We prove
Externí odkaz:
http://arxiv.org/abs/1711.11354
Following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133-141], the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyze weig
Externí odkaz:
http://arxiv.org/abs/1707.00165
We study the heavy path decomposition of conditional Galton-Watson trees. In a standard Galton-Watson tree conditional on its size $n$, we order all children by their subtree sizes, from large (heavy) to small. A node is marked if it is among the $k$
Externí odkaz:
http://arxiv.org/abs/1701.02527
Autor:
Broutin, Nicolas, Sulzbach, Henning
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of the correspo
Externí odkaz:
http://arxiv.org/abs/1610.05331
We provide asymptotic expansions for the Stirling numbers of the first kind and, more generally, the Ewens (or Karamata-Stirling) distribution. Based on these expansions, we obtain some new results on the asymptotic properties of the mode and the max
Externí odkaz:
http://arxiv.org/abs/1609.03798
We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be seen as speci
Externí odkaz:
http://arxiv.org/abs/1606.03920
A fundamental algorithm for selecting ranks from a finite subset of an ordered set is Radix Selection. This algorithm requires the data to be given as strings of symbols over an ordered alphabet, e.g., binary expansions of real numbers. Its complexit
Externí odkaz:
http://arxiv.org/abs/1605.02352
Autor:
Kuba, Markus, Sulzbach, Henning
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 $1/2$ and $1$) and triang
Externí odkaz:
http://arxiv.org/abs/1511.01618
Autor:
Sulzbach, Henning
For a martingale $(X_n)$ converging almost surely to a random variable $X$, the sequence $(X_n - X)$ is called martingale tail sum. Recently, Neininger [Random Structures Algorithms, 46 (2015), 346-361] proved a central limit theorem for the martinga
Externí odkaz:
http://arxiv.org/abs/1412.3508