Abstract
In this paper, in order to calculate the average path length for unweighted and weighted hierarchical networks, we define the sum of the distances from each node to the vertex and the bottom nodes. For the unweighted network, we show that the average path length grows with the size of [Formula: see text] as [Formula: see text]. For the weighted network, we prove its weighted path length approaches a constant related to the weighting factor [Formula: see text] and parameter [Formula: see text]. In particular, for [Formula: see text], the average weighted path length of the network tends to a specific value [Formula: see text].
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.
