Limit theorems for the weights and the degrees in an N-interactions random graph model

被引：4
|
作者：
Fazekas, Istvan [1 ]
Porvazsnyik, Bettina [1 ]
机构：
[1] Univ Debrecen, Fac Informat, Dept Appl Math & Probabil Theory, POB 400, H-4002 Debrecen, Hungary
来源：
OPEN MATHEMATICS | 2016年 / 14卷
关键词：
Random graph; Preferential attachment; Scale-free; Power law; Submartingale;
D O I：
10.1515/math-2016-0039
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：414 / 424
页数：11
相关论文
共 50 条
  • [1] Scale-Free Property for Degrees and Weights in an N-Interactions Random Graph Model*
    Fazekas I.
    Porvázsnyik B.
    Journal of Mathematical Sciences, 2016, 214 (1) : 69 - 82
  • [2] Weights and Degrees in a Random Graph Model Based on 3-Interactions
    Backhausz, A.
    Mori, T. F.
    ACTA MATHEMATICA HUNGARICA, 2014, 143 (01) : 23 - 43
  • [3] Weights and Degrees in a Random Graph Model Based on 3-Interactions
    Á. Backhausz
    T. F. Móri
    Acta Mathematica Hungarica, 2014, 143 : 23 - 43
  • [4] Limit theorems for a random graph epidemic model
    Andersson, H
    ANNALS OF APPLIED PROBABILITY, 1998, 8 (04): : 1331 - 1349
  • [5] CENTRAL LIMIT THEOREMS FOR AN INDIAN BUFFET MODEL WITH RANDOM WEIGHTS
    Berti, Patrizia
    Crimaldi, Irene
    Pratelli, Luca
    Rigo, Pietro
    ANNALS OF APPLIED PROBABILITY, 2015, 25 (02): : 523 - 547
  • [6] Limit Theorems for the Maximal Path Weight in a Directed Graph on the Line with Random Weights of Edges
    Konstantopoulos, T.
    Logachov, A., V
    Mogulskii, A. A.
    Foss, S. G.
    PROBLEMS OF INFORMATION TRANSMISSION, 2021, 57 (02) : 161 - 177
  • [7] Limit Theorems for the Maximal Path Weight in a Directed Graph on the Line with Random Weights of Edges
    T. Konstantopoulos
    A. V. Logachov
    A. A. Mogulskii
    S. G. Foss
    Problems of Information Transmission, 2021, 57 : 161 - 177
  • [8] LIMIT THEOREMS FOR A RANDOM DIRECTED SLAB GRAPH
    Denisov, D.
    Foss, S.
    Konstantopoulos, T.
    ANNALS OF APPLIED PROBABILITY, 2012, 22 (02): : 702 - 733
  • [9] Weights of cliques in a random graph model based on three-interactions
    Fazekas, Istvan
    Noszaly, Csaba
    Perecsenyi, Attila
    LITHUANIAN MATHEMATICAL JOURNAL, 2015, 55 (02) : 207 - 221
  • [10] Weights of Cliques in a Random Graph Model Based on Three-Interactions*
    István Fazekas
    Csaba Noszály
    Attila Perecsényi
    Lithuanian Mathematical Journal, 2015, 55 : 207 - 221
12345