Graph clustering in industrial networks

April 03, 2019 Β· Declared Dead Β· πŸ› IMA Journal of Applied Mathematics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors V. Bouet, A. Y. Klimenko arXiv ID 1904.02536 Category physics.soc-ph Cross-listed cs.SI, nlin.AO Citations 7 Venue IMA Journal of Applied Mathematics Last Checked 3 months ago
Abstract
The present work investigates clustering of a graph-based representation of industrial connections derived from international trade data by Hidalgo et al (2007) and confirms existence of around ten industrial clusters that are reasonably consistent with expected historical patterns of diffusion of innovation and technology. This supports the notion that technological development occurs in sequential innovation waves. The clustering method developed in this work follows conceptual ideas of Lambiotte and Barahona (2009), who suggested to use random walk to assess a hierarchical structure of network communities where different levels of the hierarchy correspond to different diffusion times. We, however, implement these ideas differently to match physics of the problem under consideration and introduce a hierarchal clustering procedure that is combined with convenient resorting of the elements. An equivalent spectral interpretation of the clustering is also given and discussed in the paper.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted