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

Abstract

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 11 asymptotically follow a twodimensional Gaussian law via multivariate martingale methods. We also study the exact distribution of the degree of a node, as the circuit ages, via a series of Pólya-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 [25].

Asymptotic normality of degree counts in a general preferential attachment model

“…In fact, several different PA models appear in the literature, depending on the concrete details of the attachment mechanism. For instance, in [5,9,15,19,20,22,23,25] the authors investigate a directed PA model, while in [6,8,9,14] an undirected version is considered. However, classical PA networks do not always fit real-world network data well, or in many applications it is natural to assign some kind of features to the vertices or to the edges.…”