Abstract
Using the generating function formalism, we propose an exact formula for estimating betweenness centrality of an edge in finite tree-like components of random networks with arbitrary degree distributions. As a function of the degrees of two vertices interconnected by the edge and the size of the component to which the edge belongs, the formula can give an estimation of the mean value of the edge betweenness. We confirm the formula by simulations for Poisson and power law distributions respectively. We also study the asymptotic behavior of the formula and find that there is an asymptotic power law relation with an exponent 1.5 between the edge betweenness and the size of the component to which the edge belongs.
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 callMore From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: 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.
