Abstract
Considering that many real networks do not have strict self-similarity property, compared with deterministic evolutionary fractal networks, networks with random sequence structure may be more in accordance with the properties of real networks. In this paper, we generate a hierarchical network by a random sequence based on BRV model. Using the encoding method, we present a way to judge whether two nodes are neighbors and calculate the total path length of the network. We get the degree distribution and limit formula of the average path length of a class of networks, which are obtained by analytical method and iterative calculation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
