Further properties of a random graph with duplications and deletions
arXiv:1409.5279
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.
arXiv comment16 pages
References in corpus (7)
- Emergence of scaling in random networks
- Organization of Growing Random Networks
- Existence of a persistent hub in the convex preferential attachment model
- Large-scale behavior of the partial duplication random graph
- Asymptotic degree distribution of a duplication-deletion random graph model
- Tracking the Empirical Distribution of a Markov-modulated Duplication-Deletion Random Graph
- On the degree distribution of a growing network model