“…To comprehensively characterize the latter (and subsequently the structure of the entire network), established metrics were used such as node degree, closeness, betweenness, and other centrality measures (Ochab, 2012; Paradowski, Jarynowski, Czopek, & Jelińska, 2021; Paradowski, Jarynowski, Jelińska, & Czopek, 2021), as well as local clustering coefficients (Saramäki et al., 2007), using generalizations of these metrics to weighted graphs (Opsahl et al., 2010), which allows for both the number and strength of interactions to contribute to the metrics. Additionally, we tested three community detection algorithms: Infomap (Rosvall & Bergstrom, 2008), Louvain method of modularity maximization (Blondel et al., 2008), and order statistics local optimization method (OSLOM; Lancichinetti et al., 2011) enhanced with the consensus algorithm by Lancichinetti & Fortunato (2012).…”