Many real-world systems can be modeled by weighted small-world networks with high clustering coefficients. Recent studies for rigorously analyzing the weighted spectral distribution（W SD） have focused on unweighted networks with low clustering coefficients. In this paper, we rigorously analyze the W SD in a deterministic weighted scale-free small-world network model and find that the W SD grows sublinearly with increasing network order（i.e., the number of nodes） and provides a sensitive discrimination for each input of this model. This study demonstrates that the scaling feature of the W SD exists in the weighted network model which has high and order-independent clustering coefficients and reasonable power-law exponents.
The comparison of networks with different orders strongly depends on the stability analysis of graph features in evolving systems. In this paper, we rigorously investigate the stability of the weighted spectral distribution（i.e., a spectral graph feature） as the network order increases. First, we use deterministic scale-free networks generated by a pseudo treelike model to derive the precise formula of the spectral feature, and then analyze the stability of the spectral feature based on the precise formula. Except for the scale-free feature, the pseudo tree-like model exhibits the hierarchical and small-world structures of complex networks. The stability analysis is useful for the classification of networks with different orders and the similarity analysis of networks that may belong to the same evolving system.
