On the Distributions of Subgraph Centralities in Complex Networks
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...
Saved in:
Main Authors: | Faxu Li, Liang Wei, Haixing Zhao, Feng Hu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2013/473248 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Complex Network Filtering and Compression Algorithm Based on Triangle-Subgraph
by: Shuxia Ren, et al.
Published: (2020-01-01) -
Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph
by: Yunhao Sun, et al.
Published: (2020-01-01) -
On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
by: Faxu Li, et al.
Published: (2014-01-01) -
Metrics for Multiset-Theoretic Subgraphs
by: Ray-Ming Chen
Published: (2019-01-01) -
On forbidden subgraphs of main supergraphs of groups
by: Xiaoyan Xu, et al.
Published: (2024-08-01)