On Nodes of Small Degrees and Degree Profile in Preferential Dynamic Attachment Circuits

被引:5
|
作者
Zhang, Panpan [1 ]
Mahmoud, Hosam [2 ]
机构
[1] Univ Penn, Dept Biostat Epidemiol & Informat, Philadelphia, PA 19104 USA
[2] George Washington Univ, Dept Stat, Washington, DC 20052 USA
关键词
Complex network; Degree profile; Multivariate martingale; Polya urn; Preferential attachment; Random circuit; ASYMPTOTIC NORMALITY; RECURSIVE TREES; LIMIT-THEOREMS; DEGREE COUNTS; LAWS; OUTPUTS; GRAPHS; FAMILY; RATES;
D O I
10.1007/s11009-019-09726-4
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We investigate the joint distribution of nodes of small degrees and the degree profile in preferential dynamic attachment circuits. In particular, we study the joint asymptotic distribution of the number of the nodes of outdegree 0 (terminal nodes) and outdegree 1 in a very large circuit. The expectation and variance of the number of those two types of nodes are both asymptotically linear with respect to the age of the circuit. We show that the numbers of nodes of outdegree 0 and 1 asymptotically follow a two-dimensional Gaussian law via multivariate martingale methods. The rate of convergence is derived analytically. We also study the exact distribution of the degree of a node, as the circuit ages, via a series of Polya-Eggenberger urn models with "hiccups" in between. The exact expectation and variance of the degree of nodes are determined by recurrence methods. Phase transitions of these degrees are discussed briefly. This is an extension of the abstract (Zhang 2016).
引用
收藏
页码:625 / 645
页数:21
相关论文
共 50 条
  • [1] On Nodes of Small Degrees and Degree Profile in Preferential Dynamic Attachment Circuits
    Panpan Zhang
    Hosam M. Mahmoud
    [J]. Methodology and Computing in Applied Probability, 2020, 22 : 625 - 645
  • [2] Inference for the degree distributions of preferential attachment networks with zero-degree nodes
    Chan, N. H.
    Cheung, Simon K. C.
    Wong, Samuel P. S.
    [J]. JOURNAL OF ECONOMETRICS, 2020, 216 (01) : 220 - 234
  • [3] Connectivity degrees in the threshold preferential attachment model
    Santiago, A.
    Benito, R. M.
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2008, 387 (10) : 2365 - 2376
  • [4] A preferential attachment model with random initial degrees
    Deijfen, Maria
    van den Esker, Henri
    van der Hofstad, Remco
    Hooghiemstra, Gerard
    [J]. ARKIV FOR MATEMATIK, 2009, 47 (01): : 41 - 72
  • [5] The Degree Distribution of Uniform and Preferential Attachment Networks
    Zhao, Qinggui
    [J]. PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON INFORMATION, ELECTRONIC AND COMPUTER SCIENCE, VOLS I AND II, 2009, : 10 - 13
  • [6] On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
    De Ambroggio, Umberto
    Polito, Federico
    Sacerdote, Laura
    [J]. PHYSICA D-NONLINEAR PHENOMENA, 2020, 414
  • [7] Vertices of high degree in the preferential attachment tree
    Brightwell, Graham
    Luczak, Malwina
    [J]. ELECTRONIC JOURNAL OF PROBABILITY, 2012, 17
  • [8] DEGREE SEQUENCES OF GEOMETRIC PREFERENTIAL ATTACHMENT GRAPHS
    Jordan, Jonathan
    [J]. ADVANCES IN APPLIED PROBABILITY, 2010, 42 (02) : 319 - 330
  • [9] Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model
    Janssen, Jeannette
    Pralat, Pawel
    Wilson, Rory
    [J]. INTERNET MATHEMATICS, 2016, 12 (1-2) : 121 - 144
  • [10] Degree-Degree Correlation in Networks with Preferential Attachment Based Growth
    Mironov, Sergei
    Sidorov, Sergei
    Malinskii, Igor
    [J]. COMPLEX NETWORKS XII, 2021, : 51 - 58