3 citations · 5 across the 4 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
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…
math.CA2011
Asymptotics of a renewal-like recursion and an integral equation
Ágnes Backhausz, Tamás F. Móri
We consider a renewal-like recursion and prove that the solution is polynomially decaying asymptotically under suitable conditions. We prove similar results for the corresponding i…