Czasopismo
Tytuł artykułu
Autorzy
Warianty tytułu
Języki publikacji
Abstrakty
A random graph evolution based on interactions of N vertices is studied. During the evolution both the preferential attachment rule and the uniform choice of vertices are allowed. The weight of an M-clique means the number of its interactions. The asymptotic behaviour of the weight of a fixed M-clique is studied. Asymptotic theorems for the weight and the degree of a fixed vertex are also presented. Moreover, the limits of the maximal weight and the maximal degree are described. The proofs are based on martingale methods.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Numer
Strony
414-424
Opis fizyczny
Daty
wydano
2016-01-01
otrzymano
2015-04-20
zaakceptowano
2016-04-20
online
2016-06-18
Twórcy
autor
- Department of Applied Mathematics and Probability Theory, Faculty of Informatics, University of Debrecen, P.O. Box 400, 4002 Debrecen,, fazekas.istvan@inf.unideb.hu
autor
- Bettina Porvázsnyik: Department of Applied Mathematics and Probability Theory, Faculty of Informatics, University of Debrecen, P.O. Box 400, 4002 Debrecen,, porvazsnyik.bettina@inf.unideb.hu
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.doi-10_1515_math-2016-0039