Ordered increasing $k$-trees: Introduction and analysis of a preferential attachment network model
Ordered increasing $k$-trees: Introduction and analysis of a preferential attachment network model
We introduce a random graph model based on $k$-trees, which can be generated by applying a probabilistic preferential attachment rule, but which also has a simple combinatorial description. We carry out a precise distributional analysis of important parameters for the network model such as the degree, the local clustering coefficient …