Community Partitioning Based on Coupling Density With Asymmetric Similarity Between Vertexes

Community partitioning has become an important approach for uncovering underlying patterns in complex network analysis. This paper proposes a coupling density model with asymmetric similarity between vertices, which considers weighted coupling relations between connected groups and vertex similarities to guide the generation of new partitions and to measure inter-community similarity. Directed similarity, as a promising quality criterion, captures the directional tendency from one vertex to another by incorporating local attributes such as degree, neighbors, co-neighbors, and their interrelations. Theoretical and empirical evaluations on both real-world and synthetic networks demonstrate that the proposed metric model outperforms traditional modularity and standard density measures. Furthermore, the model was effectively applied to analyze textile-related trade networks.

Authors

Publication Details

Journal
International Journal of Cognitive Informatics and Natural Intelligence
Published
2025-05-02
DOI
https://doi.org/10.4018/ijcini.375349
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Community Partitioning Based on Coupling Density With Asymmetric Similarity Between Vertexes

Fahong Yu, Meijia Chen, Dongping Zhu
International Journal of Cognitive Informatics and Natural Intelligence
Complex Network Analysis Techniques
article

Community Partitioning Based on Coupling Density With Asymmetric Similarity Between Vertexes

Fahong Yu, Meijia Chen, Dongping Zhu
article en

Abstract

Community partitioning has become an important approach for uncovering underlying patterns in complex network analysis. This paper proposes a coupling density model with asymmetric similarity between vertices, which considers weighted coupling relations between connected groups and vertex similarities to guide the generation of new partitions and to measure inter-community similarity. Directed similarity, as a promising quality criterion, captures the directional tendency from one vertex to another by incorporating local attributes such as degree, neighbors, co-neighbors, and their interrelations. Theoretical and empirical evaluations on both real-world and synthetic networks demonstrate that the proposed metric model outperforms traditional modularity and standard density measures. Furthermore, the model was effectively applied to analyze textile-related trade networks.

International Journal of Cognitive Informatics and Natural IntelligenceVol. 19(1)
Openalex Percentile: Top 93%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.