Abstract
Some growth asymptotics of a version of 'preferential attachment' random graphs are studied through an embedding into a continuous-time branching scheme. These results complement and extend previous work in the literature.
Original language | English (US) |
---|---|
Pages (from-to) | 473-494 |
Number of pages | 22 |
Journal | Proceedings of the Indian Academy of Sciences: Mathematical Sciences |
Volume | 118 |
Issue number | 3 |
DOIs | |
State | Published - Aug 2008 |
Externally published | Yes |
Keywords
- Branching processes
- Embedding
- Preferential attachment
- Random graph
- Scale-free
ASJC Scopus subject areas
- General Mathematics