Twin Subgraphs and Core-Semiperiphery-Periphery Structures
A standard approach to reduce the complexity of very large networks is to group together sets of nodes into clusters according to some criterion which reflects certain structural properties of the network. Beyond the well-known modularity measures defining communities, there are criteria based on th...
Saved in:
Main Author: | Ricardo Riaza |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2018-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2018/2547270 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph
by: Yunhao Sun, et al.
Published: (2020-01-01) -
Metrics for Multiset-Theoretic Subgraphs
by: Ray-Ming Chen
Published: (2019-01-01) -
Resilience of Core-Periphery Networks in the Case of Rich-Club
by: Matteo Cinelli, et al.
Published: (2017-01-01) -
The Core-Periphery Structure in the Yangtze River Delta: An Enterprise Linkage Perspective, 1978–2019
by: Jieying Yang, et al.
Published: (2021-01-01) -
On the Distributions of Subgraph Centralities in Complex Networks
by: Faxu Li, et al.
Published: (2013-01-01)