Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T21:24:48.683Z Has data issue: false hasContentIssue false

Asymptotic Properties of a Random Graph with Duplications

Published online by Cambridge University Press:  30 January 2018

Ágnes Backhausz*
Affiliation:
Eötvös Loránd University
Tamás F. Móri*
Affiliation:
Eötvös Loránd University
*
∗ Postal address: MTA Alfréd Rényi Institute of Mathematics, Pázmány P. s. 1/C, H-1117, Budapest, Hungary. Email address: agnes@math.elte.hu
∗∗ Postal address: Department of Probability Theory and Statistics, Pázmány P. s. 1/C, H-1117, Budapest, Hungary. Email address: mori@math.elte.hu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 asymptotic degree distribution, with stretched exponential decay; more precisely, the proportion of vertices of degree d tends to some positive number c d > 0 almost surely as the number of steps goes to ∞, and c d ~ (eπ)1/2 d 1/4e-2√d holds as d → ∞.

Information

Type
Research Article
Copyright
© Applied Probability Trust