This article examines the resilience of different Apollonian network (AN) types—
deterministic, random, and evolutionary—to systematic attacks. ANs, members of the family …

We consider the height of random k‐trees and k‐Apollonian networks. These random
graphs are not really trees, but instead have a tree‐like structure. The height will be the …

Let r and d be positive integers with r< d. Consider a random d-ary tree constructed as
follows. Start with a single vertex, and in each time-step choose a uniformly random leaf and …

We present a new technique for proving logarithmic upper bounds for diameters of evolving
random graph models, which is based on defining a coupling between random graphs and …

This study explores the probabilistic and statistical properties of several popular random
networks. We focus on (random) Apollonian networks, their sister structures k-trees, and …

In this work, we use rigorous probabilistic methods to study the asymptotic degree
distribution, clustering coefficient, and diameter of geographical attachment networks. As a …

In this article, we investigate several properties of high-dimensional random Apollonian
networks, including two types of degree profiles, the small-world effect (clustering property) …

We study heavy subtrees of conditional Galton-Watson trees. In a standard Galton-Watson
tree conditional on its size being n, we order all children by their subtree sizes, from large …

随机k-树的最大度数 Page 1 第50卷第3期 Vol.50,No.3 2020年3月
JOURNALOFUNIVERSITYOFSCIENCEANDTECHNOLOGYOFCHINA Mar.2020 文章编号:0253-2778(2020)03-0328-07 …

We study the heavy path decomposition of conditional Galton-Watson trees. In a standard
Galton-Watson tree conditional on its size $ n $, we order all children by their subtree sizes …