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

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2014-08
1. Verfasser:	Thörnblad, Erik
Format:	Artikel
Sprache:	eng
Schlagworte:	Asymptotic properties Decay rate Deletion Graph theory Mathematics - Combinatorics Mathematics - Probability Power law Reproduction (copying)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!