arXiv Analytics

Sign in

arXiv:1405.1267 [math.PR]AbstractReferencesReviewsResources

The asymptotic behaviour of the weights and the degrees in an N-interactions random graph model

István Fazekas, Bettina Porvázsnyik

Published 2014-05-06Version 1

A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its interactions. The asymptotic behaviour of the weight and the degree of a fixed vertex, moreover the limit of the maximal weight and the maximal degree are described. The proofs are based on martingale methods.

Comments: 15 pages
Categories: math.PR
Subjects: 05C80, 60G42
Related articles: Most relevant | Search more
arXiv:math/0608211 [math.PR] (Published 2006-08-09)
On the asymptotic behaviour of random recursive trees in random environment
arXiv:1308.0549 [math.PR] (Published 2013-08-02)
Asymptotic behaviour near extinction of continuous state branching processes
arXiv:math/0307204 [math.PR] (Published 2003-07-15)
Asymptotic behaviour of watermelons

Links

Toolbox