31 citations · 53 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
A random graph model based on 3-interactions
Ágnes Backhausz, Tamás F. Móri
We consider a random graph model evolving in discrete time-steps that is based on 3-interactions among vertices. Triangles, edges and vertices have different weights; objects with…
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…
A random model of publication activity
Ágnes Backhausz, Tamás F. Móri
We examine a random model consisting of objects with positive weights and evolving in discrete time steps, which generalizes certain random graph models. We prove almost sure conve…