5 citations · 11 across the 7 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.PR2011★ 5 cited
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…
cs.DM2011★ 2 cited
On Erdős-Gallai and Havel-Hakimi algorithms
A. Iványi, L. Lucz, T. F. Móri +1
Havel in 1955, Erdős and Gallai in 1960, Hakimi in 1962, Ruskey, Cohen, Eades and Scott in 1994, Barnes and Savage in 1997, Kohnert in 2004, Tripathi, Venugopalan and West in 2010…
math.PR2011★ 2 cited
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…