Papers › Social Network Analysis of Corruption Structures: Adjacency Matrices Supporting the...
Social Network Analysis of Corruption Structures: Adjacency Matrices Supporting the Visualization and Quantification of Layeredness
Carel F. W. Peeters
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Often, corruption is described as taking place within or supported by a network: A collection of individuals structured in such a way as to enable the transaction of bribes for favors. Surprisingly, despite the network nomenclature, corruption is rarely analyzed from the network perspective using the tools of network science. Here, we will argue that analyzing corruption from the perspective of network science is beneficial to its understanding. In passing this chapter, a contribution to the Liber Amicorum in honor of Leo Huberts, then gives a very short introduction into social network analysis.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections