Further properties of a random graph with duplications and deletions
Probability
2014-09-19 v1
Abstract
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 probability. We analyse the limit distribution of the degree of a fixed vertex, and derive a.s. asymptotic bounds for the maximal degree. The model shows a phase transition phenomenon with respect to the probabilities of duplication and deletion.
Keywords
Cite
@article{arxiv.1409.5279,
title = {Further properties of a random graph with duplications and deletions},
author = {Ágnes Backhausz and Tamás F. Móri},
journal= {arXiv preprint arXiv:1409.5279},
year = {2014}
}
Comments
16 pages