Back to Search
Start Over
IDENTIFICATION OF COMMUNITY STRUCTURE IN NETWORKS USING HIGHER ORDER NEIGHBORHOOD CONCEPTS.
- Source :
- International Journal of Bifurcation & Chaos in Applied Sciences & Engineering; Aug2009, Vol. 19 Issue 8, p2677-2685, 9p, 2 Diagrams, 2 Graphs
- Publication Year :
- 2009
-
Abstract
- The identification of community structures in networks is investigated within a framework based on the concepts of higher order neighborhoods and neighborhood matrix $\hat{M}$. This procedure is of relevance especially for networks representing evolutionary situations, since several evidences show that they are assembled from pre-existing smaller structures, rather than by the mere adhesion of individual nodes. We proceed within the successive elimination of the links with largest betweenness degree. The effect of erasing a link at step k is quantified by the distance between $\hat{M}^{k-1}$ and $\hat{M}^{k}$, which describe the network neighborhoods prior and after the kth link elimination. For modular networks, this measure is characterized by a very long sequence of sharp peaks, following a much more complete cascade of cluster splitting. The evidences indicate that this method identifies a more precise description of smaller communities splitting than the one based on modularity function. [ABSTRACT FROM AUTHOR]
- Subjects :
- COMMUNITY organization
MATRICES (Mathematics)
TECHNOLOGY
PHYSICS
STRUCTURAL frames
Subjects
Details
- Language :
- English
- ISSN :
- 02181274
- Volume :
- 19
- Issue :
- 8
- Database :
- Complementary Index
- Journal :
- International Journal of Bifurcation & Chaos in Applied Sciences & Engineering
- Publication Type :
- Academic Journal
- Accession number :
- 44985635
- Full Text :
- https://doi.org/10.1142/S0218127409024396