Skip to main content Accessibility help
×
Home

DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS

  • Yarong Feng (a1), Hosam Mahmoud (a1) and Ludger Rüschendorf (a2)

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.

Copyright

References

Hide All
1. Bernasconi, N., Panagiotou, K., & Steger, A. (2008). On the degree sequences of random outerplanar and series-parallel graphs. Lecture Notes in Computer Science 5171: 303316.
2. Bickel, P. & Freedman, D. (1981). Some asymptotic theory for the bootstrap. The Annals of Statistics 9: 11961217.
3. Cramer, M. & Rüschendorf, L. (1996). Convergence of a branching type recursion. Annales de l'Iinstitut Henri Poincaré, Probabilités et Statistiques 32: 725741.
4. Drmota, M., Giménez, O., & Noy, M. (2010). Vertices of given degree in series-parallel graphs. Random Structures & Algorithms 36: 273314.
5. Eppstein, D. (1992). Parallel recognition of series-parallel graphs. Information and Computation 98: 4155.
6. Farmakis, I. & Moskowitz, M. (2013). Fixed point theorems and their applications. New Jersey: World Scientific.
7. Feng, Q. (2014). Random fast growth models for treelike networks. Private Communication.
8. Hambly, B. & Jordan, J. (2004). A random hierarchical lattice: the series-parallel graph and its properties. Advances in Applied Probability 36: 824838.
9. Karr, A. (1993). Probability. New York: Springer.
10. Mahmoud, H. (2013). Some node degree properties of series-parallel graphs evolving under a stochastic growth model. Probability in the Engineering and Informational Sciences 27: 297307.
11. Mahmoud, H. (2014). Some properties of binary series-parallel graphs. Probability in the Engineering and Informational Sciences 28: 565572.
12. Neininger, R. & Rüschendorf, L. (2004). A general limit theorem for recursive algorithms and combinatorial structures. The Annals of Applied Probability 14: 378418.
13. Neininger, R. (2001). On a multivariate contraction method for random recursive structures with applications to Quicksort. Random Structures and Algorithms 19: 498524.
14. Rachev, S. & Rüschendorf, L. (1995). Probability metrics and recursive algorithms. Advances in Applied Probability 27: 770799.
15. Rösler, U. (1991). A limit theorem for “Quicksort.RAIRO Inform. Théor. Appl. 25: 85100.
16. Rösler, U. & Rüschendorf, L. (2001). The contraction method for recursive algorithms. Algorithmica 29: 333.
17. Vervaat, W. (1979). On a stochastic difference equation and a representation of non-negative infinitely divisible random variables. Advances in Applied Probability 11: 750783.
18. Zhang, Z., Qi, Y., Zhou, S., Gao, S., & Guan, J. (2010). Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees. Physical Review, E 81: 016114.

Keywords

Related content

Powered by UNSILO

DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS

  • Yarong Feng (a1), Hosam Mahmoud (a1) and Ludger Rüschendorf (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.