Zobrazeno 1 - 10
of 206
pro vyhledávání: '"Michael Drmota"'
Autor:
Cyril Banderier, Michael Drmota
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
This paper studies the coefficients of algebraic functions. First, we recall the too-little-known fact that these coefficients $f_n$ have a closed form. Then, we study their asymptotics, known to be of the type $f_n \sim C A^n n^{\alpha}$. When the f
Externí odkaz:
https://doaj.org/article/c1f2d2230c4c48398d8449c07c37f877
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
In this paper infinite systems of functional equations in finitely or infinitely many random variables arising in combinatorial enumeration problems are studied. We prove sufficient conditions under which the combinatorial random variables encoded in
Externí odkaz:
https://doaj.org/article/1973a48f493c49dba472afc69714f60c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AI,..., Iss Proceedings (2008)
We prove that for each $k \geq 0$, the probability that a root vertex in a random planar graph has degree $k$ tends to a computable constant $d_k$, and moreover that $\sum_k d_k =1$. The proof uses the tools developed by Gimènez and Noy in their sol
Externí odkaz:
https://doaj.org/article/28a056a1315b4d8dbf49a9c0a886c81c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AI,..., Iss Proceedings (2008)
We develop a combinatorial structure to serve as model of random real world networks. Starting with plane oriented recursive trees we substitute the nodes by more complex graphs. In such a way we obtain graphs having a global tree-like structure whil
Externí odkaz:
https://doaj.org/article/92ae22303fad41199a2b6f0ec67faecb
Autor:
Michael Drmota, Wojciech Szpankowski
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AH,..., Iss Proceedings (2007)
We study a random walk with positive drift in the first quadrant of the plane. For a given connected region $\mathcal{C}$ of the first quadrant, we analyze the number of paths contained in $\mathcal{C}$ and the first exit time from $\mathcal{C}$. In
Externí odkaz:
https://doaj.org/article/c0440b6d8e584337898166204013b9cf
Autor:
Michael Drmota
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)
The purpose of this survey is to present recent results concerning concentration properties of extremal parameters of random discrete structures. A main emphasis is placed on the height and maximum degree of several kinds of random trees. We also pro
Externí odkaz:
https://doaj.org/article/db9b0ed2cd02495b8cd124b451c6cf6e
Autor:
Michael Drmota, Bernhard Gittenberger
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 6, Iss 2 (2004)
It is proved that the moments of the width of Galton-Watson trees of size n and with offspring variance σ 2 are asymptotically given by (σ√ n) p m p where m p are the moments of the maximum of the local time of a standard scaled Brownian excursio
Externí odkaz:
https://doaj.org/article/a656bddebdd3496589e774ed23abcbca
Autor:
Michael Drmota
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AC,..., Iss Proceedings (2003)
In this paper we consider discrete random walks on infinite graphs that are generated by copying and shifting one finite (strongly connected) graph into one direction and connecting successive copies always in the same way. With help of generating fu
Externí odkaz:
https://doaj.org/article/d67ed215d3294a258d5d7124489e8a69
Autor:
Michael Drmota, Helmut Prodinger
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 5, Iss 1 (2002)
q-binary search trees are obtained from words, equipped with a geometric distribution instead of permutations. The average and variance of the heighth computated, based on random words of length n, as well as a Gaussian limit law.
Externí odkaz:
https://doaj.org/article/5aa057e3903c46e98c382e8aee652d16
Autor:
Martin Goldstern, Michael Drmota
Publikováno v:
Uniform distribution theory. 16:129-136
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acd3340e13900e5cb9ca98d6739e6606
https://doi.org/10.2478/udt-2021-0011
https://doi.org/10.2478/udt-2021-0011