Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Rudolf Grübel"'
Autor:
Rudolf Grübel
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:1, Iss Analysis of Algorithms (2023)
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of
Externí odkaz:
https://doaj.org/article/95ac4d229ec04f02a1b4e1dcd162113f
Autor:
Rudolf Grübel
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 1, Iss Analysis of Algorithms (2015)
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search algorithms we s
Externí odkaz:
https://doaj.org/article/600f4b75386b4cbf98c7f02ad9d8e3e7
Autor:
Rudolf Grübel
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AH,..., Iss Proceedings (2007)
It is well known that many distributions that arise in the analysis of algorithms have an asymptotically fluctuating behaviour in the sense that we do not have 'full' convergence, but only convergence along suitable subsequences as the size of the in
Externí odkaz:
https://doaj.org/article/0b081a3e887a40d290c69554423dae64
Autor:
Rudolf Grübel
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)
We give several examples for Poisson approximation of quantities of interest in the analysis of algorithms: the distribution of node depth in a binary search tree, the distribution of the number of losers in an election algorithm and the discounted p
Externí odkaz:
https://doaj.org/article/f5a9e58764ea4c9bb21c1c9d42ddc891
Autor:
Ludwig Baringhaus, Rudolf Grübel
We obtain discrete mixture representations for parametric families of probability distributions on Euclidean spheres, such as the von Mises--Fisher, the Watson and the angular Gaussian families. In addition to several special results we present a gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::543b52238e32da061fc380b73d5da058
Autor:
Ludwig Baringhaus, Rudolf Grübel
Publikováno v:
Metrika. 85:419-458
We introduce and discuss a multivariate version of the classical median that is based on an equipartition property with respect to quarter spaces. These arise as pairwise intersections of the half-spaces associated with the coordinate hyperplanes of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bba07f57bd3b946618553587aa130f56
https://doi.org/10.1007/s00184-021-00836-z
https://doi.org/10.1007/s00184-021-00836-z
Autor:
Ludwig Baringhaus, Rudolf Grübel
With any symmetric distribution $\mu$ on the real line we may associate a parametric family of noncentral distributions as the distributions of $(X+\delta)^2$, $\delta\not=0$, where $X$ is a random variable with distribution $\mu$. The classical case
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0840b27e3525daba21d0e58a21973ab
http://arxiv.org/abs/2206.10236
http://arxiv.org/abs/2206.10236
Autor:
Rudolf Grübel, Ludwig Baringhaus
Publikováno v:
Electron. J. Statist. 15, no. 1 (2021), 37-70
We investigate existence and properties of discrete mixture representations $P_{\theta }=\sum _{i\in E}w_{\theta }(i)\,Q_{i}$ for a given family $P_{\theta }$, $\theta \in \Theta $, of probability measures. The noncentral chi-squared distributions pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abf0b51b604ddb954828fefb177fd985
https://doi.org/10.1214/20-ejs1795
https://doi.org/10.1214/20-ejs1795
Autor:
Joachim Engel, Rudolf Grübel
Publikováno v:
Facetten der Mathematik ISBN: 9783662556559
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f4e2ada76b49fe58cdb68b217dd5801
https://doi.org/10.1007/978-3-662-55656-6_14
https://doi.org/10.1007/978-3-662-55656-6_14
Publikováno v:
Ann. Probab. 45, no. 1 (2017), 225-277
The Annals of Probability, vol 45, iss 1
The Annals of Probability, vol 45, iss 1
Author(s): Evans, SN; Grubel, R; Wakolbinger, A | Abstract: Remy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the nth tree is uniformly distributed over the set of rooted, planar, binary trees
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27168b66ff63b997238a9ccc27ffc30c
https://doi.org/10.1214/16-aop1112
https://doi.org/10.1214/16-aop1112