Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T10:33:49.974Z Has data issue: false hasContentIssue false

DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS

Published online by Cambridge University Press:  13 September 2016

Yarong Feng
Affiliation:
Department of Statistics, The George Washington University, Washington, DC 20052, USA E-mails: yfeng14@gwu.edu; hosam@gwu.edu
Hosam Mahmoud
Affiliation:
Department of Statistics, The George Washington University, Washington, DC 20052, USA E-mails: yfeng14@gwu.edu; hosam@gwu.edu
Ludger Rüschendorf
Affiliation:
Department of Mathematical Stochastics, University of Freiburg, Eckerstraße 1, D-79104 Freiburg, Germany E-mail: ruschen@stochastik.uni-freiburg.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2016