Self-organized Model for Modular Complex Networks : Division and Independence
| dc.creator | Kim, D. -H. | |
| dc.creator | Rodgers, G. J. | |
| dc.creator | Kahng, B. | |
| dc.creator | Kim, D. | |
| dc.date | 2003-10-10 | |
| dc.date.accessioned | 2026-07-07T02:54:07Z | |
| dc.date.available | 2026-07-07T02:54:07Z | |
| dc.description | We introduce a minimal network model which generates a modular structure in a self-organized way. To this end, we modify the Barabasi-Albert model into the one evolving under the principle of division and independence as well as growth and preferential attachment (PA). A newly added vertex chooses one of the modules composed of existing vertices, and attaches edges to vertices belonging to that module following the PA rule. When the module size reaches a proper size, the module is divided into two, and a new module is created. The karate club network studied by Zachary is a prototypical example. We find that the model can reproduce successfully the behavior of the hierarchical clustering coefficient of a vertex with degree k, C(k), in good agreement with empirical measurements of real world networks. | |
| dc.description | 4 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0310233 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0310233 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/22416 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Self-organized Model for Modular Complex Networks : Division and Independence | |
| dc.type | text |