In this paper, we present a rigorous analysis on the limiting behavior of the degree
distribution of the partial duplication model, a random network growth model in the …

We consider the connected component of the partial duplication model for a random graph,
a model which was introduced by Bhan, Galas and Dewey as a model for gene expression …

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 almost surely …

We introduce a model for a growing random graph based on simultaneous reproduction of
the vertices. The model can be thought of as a generalisation of the reproducing graphs of …

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 …

Many real world networks grow because their elements get replicated. Previously Southwell
and Cannings introduced a class of models within which networks change because the …

We prove that the Barab\'asi-Albert model converges weakly to a set of generalized Yule
models via an appropriate scaling. To pursue this aim we superimpose to its graph structure …

Tartalomjegyzék Page 1 Random graphs Spring 2017/2018 Agnes Backhausz Tartalomjegyzék
1. Introduction 3 2. Erdos–Rényi random graph and connectivity 3 2.1. The size of the largest …