3 citations · 5 across the 4 of their papers we have counts for
Showing math.PRShow all
3 papers · 1 filter
math.PR2024
Three classical probability problems: the Hungarian roulette
Tamás F. Móri, Gábor J. Székely
In this paper three unrelated problems will be discussed. What connects them is the rich methodology of classical probability theory. In the first two problems we have a complete a…
math.PR2018
Random cherry graphs
Tamás F. Móri, Sándor Rokob
Due to the popularity of randomly evolving graph processes, there exists a randomized version of many recursively defined graph models. This is also the case with the cherry tree,…
math.PR2011★ 2 cited
Degree distribution in the lower levels of the uniform recursive tree
Ágnes Backhausz, Tamás F. Móri
In this note we consider the th level of the uniform random recursive tree after steps, and prove that the proportion of nodes with degree greater than converges t…