Abstract
Self-similarity is a significant property for complex networks. Box coverage method and dimension calculation are vital tools to study the characteristic of complex networks. In this paper, we propose an outside-in (OSI) box covering method for the Sierpinski networks, and it is attested that this coverage algorithm is superior to CBB algorithm. In addition, we deduce the optimal box recurrence formula of weighted and unweighted networks theoretically, and the result is the same as that of the algorithm value. We also obtain the information dimension of weighted network, which verifies the validity and feasibility of our method.
Sign-in/Register to access full text options 
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.
