Betweenness centrality in finite components of complex networks

Shan He, Sheng Li and Hongru Ma

Physica A: Statistical Mechanics and its Applications, 2009, vol. 388, issue 19, 4277-4285

Abstract: We use generating function formalism to obtain an exact formula of the betweenness centrality in finite components of random networks with arbitrary degree distributions. The formula is obtained as a function of the degree and the component size, and is confirmed by simulations for Poisson, exponential, and power-law degree distributions. We find that the betweenness centralities for the three distributions are asymptotically power laws with an exponent 1.5 and are invariant to the particular distribution parameters.

Keywords: Betweenness centrality; Finite components; Random networks (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437109004919
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:388:y:2009:i:19:p:4277-4285

DOI: 10.1016/j.physa.2009.06.035

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().