Asymptotic Degree Distribution of a Duplication–Deletion Random Graph Model
Asymptotic Degree Distribution of a Duplication–Deletion Random Graph Model
We study a discrete–time duplication–deletion random graph model and analyse its asymptotic degree distribution. The random graphs consists of disjoint cliques. In each time step either a new vertex is brought in with probability 0 < _p_ < 1 and attached to an existing clique, chosen with probability proportional to …