DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS. Issue 1 (13th September 2016)

• Record Type: Journal Article
• Authors: Feng, Yarong; Mahmoud, Hosam; Rüschendorf, Ludger
• Is Part Of: Probability in the engineering and informational sciences. Volume 31:Issue 1(2017)
• Page Start: 60
• Page End: 82
• Publication Date: 2016-09-13
• Subjects: applied probability, -- graphs, -- probabilistic networks, -- stochastic modelling; Probabilities -- Periodicals; Engineering -- Statistical methods -- Periodicals; Information science -- Statistical methods -- Periodicals; 519.202462
• DOI: 10.1017/S0269964816000310
• Languages: English
• ISSNs: 0269-9648

Abstract

Abstract : We study the degree profile of random hierarchical lattice networks. At every step, each edge is either serialized (with probability p ) or parallelized (with probability 1− p ). We establish an asymptotic Gaussian law for the number of nodes of outdegree 1, and show how to extend the derivations to encompass asymptotic limit laws for higher outdegrees. The asymptotic joint distribution of the number of nodes of outdegrees 1 and 2 is shown to be bivariate normal. No phase transition with p is detected in these asymptotic laws. For the limit laws, we use ideas from the contraction method. The recursive equations which we get involve coefficients and toll terms depending on the recursion variable and thus are not in the standard form of the contraction method. Yet, an adaptation of the contraction method goes through, showing that the method has promise for a wider range of random structures and algorithms.