Weighted network modules
| dc.creator | Farkas, Illes J. | |
| dc.creator | Abel, Daniel | |
| dc.creator | Palla, Gergely | |
| dc.creator | Vicsek, Tamas | |
| dc.date | 2007-03-27 | |
| dc.date.accessioned | 2026-07-07T08:18:50Z | |
| dc.date.available | 2026-07-07T08:18:50Z | |
| dc.description | The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm (CPMw, Clique Percolation Method with weights) for weighted networks based on the concept of percolating k-cliques with high enough intensity. The algorithm allows overlaps between the modules. First, we give detailed analytical and numerical results about the critical point of weighted k-clique percolation on (weighted) Erdos-Renyi graphs. Then, for a scientist collaboration web and a stock correlation graph we compute three-link weight correlations and with the CPMw the weighted modules. After reshuffling link weights in both networks and computing the same quantities for the randomised control graphs as well, we show that groups of 3 or more strong links prefer to cluster together in both original graphs. | |
| dc.description | 19 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0703706 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0703706 | |
| dc.identifier | New J. Phys. 9, 180 (2007) | |
| dc.identifier | doi:10.1088/1367-2630/9/6/180 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134572 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Weighted network modules | |
| dc.type | text |