On the Distributions of Subgraph Centralities in Complex Networks

Faxu Li, Liang Wei, Haixing Zhao and Feng Hu

Discrete Dynamics in Nature and Society, 2013, vol. 2013, 1-8

Abstract:

Subgraph centrality measure characterizes the participation of each node in all subgraphs in a network. Smaller subgraphs are given more weight than large ones, which makes this measure appropriate for characterizing network motifs. This measure is better in being able to discriminate the nodes of a network than alternate measures. In this paper, the important issue of subgraph centrality distributions is investigated through theory-guided extensive numerical simulations, for three typical complex network models, namely, the ER random-graph networks, WS small-world networks, and BA scale-free networks. It is found that these three very different types of complex networks share some common features, particularly that the subgraph centrality distributions in increasing order are all insensitive to the network connectivity characteristics, and also found that the probability distributions of subgraph centrality of the ER and of the WS models both follow the gamma distribution, and the BA scale-free networks exhibit a power-law distribution with an exponential cutoff.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2013/473248.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2013/473248.xml (text/xml)

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:hin:jnddns:473248

DOI: 10.1155/2013/473248

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().