A two-stage algorithm for extracting the multiscale backbone of complex weighted networks
- 30 June 2009
- journal article
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 106 (26) , E66
Abstract
The central problem of concern to Serrano, Boguñá, and Vespignani (1) can be effectively and elegantly addressed using a well-established two-stage algorithm that has been applied to internal migration flows for numerous nations and several other forms of “transaction flow data” (2, 3, 4). In the first stage, the N row and N column sums of the N × N matrix of weighted, directed network flows (fij) are alternately scaled to all equal 1, iteratively, until sufficient convergence to a doubly stochastic table is attained. So doing serves as a control for multiscale effects. [This procedure, convergent under broad conditions …Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Extracting the multiscale backbone of complex weighted networksProceedings of the National Academy of Sciences, 2009
- Hierarchical Internal Migration Regions of FranceIEEE Transactions on Systems, Man, and Cybernetics, 1976
- A hierarchical regionalization of Japanese prefectures using 1972 interprefectural migration flowsRegional Studies, 1976
- A role for doubly stochastic matrices in graph theoryProceedings of the American Mathematical Society, 1972