activity
20102018
most citedA random graph model based on 3-interactions

5 citations · 11 across the 7 of their papers we have counts for

collaborators

8 papers

math.PR2018

Moments of general time dependent branching processes with applications

Tamás F. Móri, Sándor Rokob

In this paper, we give sufficient conditions for a Crump-Mode-Jagers process to be bounded in for a given . This result is then applied to a recent random graph process…

math.PR2014

Further properties of a random graph with duplications and deletions

Ágnes Backhausz, Tamás F. Móri

We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probabil…

math.PR2013★ 1 cited

Asymptotic properties of a random graph with duplications

Ágnes Backhausz, Tamás F. Móri

We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic de…

stat.CO2012★ 1 cited

Testing goodness-of-fit of random graph models

Villö Csiszár, Péter Hussami, János Komlós +3

Random graphs are matrices with independent 0, 1 elements with probabilities determined by a small number of parameters. One of the oldest model is the Rasch model where the odds a…

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…

math.PR2010

Local degree distribution in scale free random graphs

Agnes Backhausz, Tamas F. Mori

In several scale free graph models the asymptotic degree distribution and the characteristic exponent change when only a smaller set of vertices is considered. Looking at the commo…