Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T07:00:29.609Z Has data issue: false hasContentIssue false

THE ASYMPTOTIC DEGREE DISTRIBUTIONS OF RANDOM FAST GROWTH MODELS FOR TREELIKE NETWORKS

Published online by Cambridge University Press:  03 January 2017

Qunqiang Feng
Affiliation:
Department of Statistics and Finance, School of Management, University of Science and Technology of China, Hefei 230026, China E-mail: fengqq@ustc.edu.cn; huzs@ustc.edu.cn
Zhishui Hu
Affiliation:
Department of Statistics and Finance, School of Management, University of Science and Technology of China, Hefei 230026, China E-mail: fengqq@ustc.edu.cn; huzs@ustc.edu.cn
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 propose two random network models for complex networks, which are treelike and always grow very fast. One is the uniform model and the other is the preferential attachment model, and both of them depends on a parameter 0<p<1. We first briefly discuss the network sizes, each of which can be corresponding to a supercritical branching process. And then we mainly study the degree distributions of both models. The asymptotic degree distribution of the first one with any parameter 0<p<1 is a geometric distribution with parameter 1/2, whereas that of the second one, which depends on p, can be uniquely determined by a functional equation of its probability generating function.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2017