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 infinity, and c(d) similar to (e pi)(1/2)d(1/4)e(-2)root d holds as d -> infinity.
Asymptotic Properties of a Random Graph with Duplications
Published 2013 in Journal of Applied Probability
ABSTRACT
PUBLICATION RECORD
- Publication year
2013
- Venue
Journal of Applied Probability
- Publication date
2013-08-07
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-26 of 26 references · Page 1 of 1
CITED BY
Showing 1-13 of 13 citing papers · Page 1 of 1