 Research
 Open Access
 Published:
Global and local community memberships for estimating spreading capability of nodes in social networks
Applied Network Science volume 6, Article number: 84 (2021)
Abstract
The analysis of spreading processes within complex networks can offer many important insights for the application in contexts such as epidemics, information dissemination or rumours. Particularly, structural factors of the network which either contribute or hinder the spreading are of interest, as they can be used to control or predict such processes. In social networks, the community structure is especially relevant, as actors usually participate in different densely connected social groups which emerge from various contexts, potentially allowing them to inject the spreading process into many different communities quickly. This paper extends our recent findings on the community membership of nodes and how it can be used to predict their individual spreading capability (Krukowski and Hecking, in: Benito, Cherifi, Cherifi, Moro, Rocha, SalesPardo (eds) Complex networks & their applications IX. Springer, Cham, pp 408–419, 2021) by further evaluating it on additional networks (both realworld networks and artificially generated networks), while additionally introducing a new local measure to identify influential spreaders that—in contrast to most other measures, does not rely on knowledge of the global network structure. The results confirm our recent findings, showing that the community membership of nodes can be used as a predictor for their spreading capability, while also showing that especially the local measure proves to be a good predictor, effectively outperforming the global measure in many cases. The results are discussed with regard to realworld use cases, where knowledge of the global structure is often not given, yet a prediction regarding the spreading capability highly desired (e.g., contacttracing apps).
Introduction
The study of spreading processes on networks has a long research history in information diffusion in social networks (Guille et al. 2013), computer communication (Balthrop et al. 2004), and epidemiology (Nowzari et al. 2016). Insights in this regard are of high relevance for better control of spreading either for increasing influence and reach in social networks (Kempe et al. 2003) or for hindering the spread of viruses (Nowzari et al. 2016).
It is well established that network topology is a major factor governing spreading processes (Peng et al. 2020; Cherifi et al. 2019), and it has been shown that real world networks often exhibit smallworld properties with scalefree degree distributions, which allows viruses and information to proliferate and cover large parts of such networks quickly (PastorSatorras and Vespignani 2001; Wu et al. 2004). One overarching goal of most studies on information diffusion in networks is to predict the efficiency of the underlying spreading process, i.e. how quickly and how pervasively the nodes in a network get infected by a spreading item (information, rumor, virus, etc.). Being referred to as immunisation or attack strategies, they usually examine which nodes exert the most influence on the information diffusion process, i.e., are the most influential spreaders, in order to either immunise or attack them and better control the spreading (Cherifi et al. 2019; Magelinski et al. 2021). In this context, topological properties of nodes (e.g., centrality, community membership) are of interest. Such properties can be discovered by using local information on the node level or by examining the global network structure. A particularly important topological feature which influences the efficiency of the spreading process is the community structure of networks and the resulting properties of nodes (Rajeh et al. 2021; Ghalmane et al. 2019a, b; Kitsak et al. 2010). To this end, Kitsak et al. (2010) showed that the most efficient spreaders within a network are not necessarily the most central nodes (i.e. nodes with the highest degree), but the ones located in densely connected cores of the network indicated by a high kshell index. This insight was accompanied by our recent study on the positive effect of node membership in multiple overlapping and densely connected clusters in a network (Krukowski and Hecking 2021). Here, the general idea is that someone who is member of many different overlapping social groups (workplace, sports club, friendship circles) is better capable of injecting a spreading item into various densely connected regions of the network where it further circulates. Multiple approaches exist to detect such overlapping clusters (Xie et al. 2013). In this paper, we use the linkcommunities algorithm by Ahn et al. (2010), where resulting clusters are highly interleaved and sometimes even nested. The spreading capability of a node is then modelled as a function of the number of such clusters in which it occurs.
The discovery of such node properties and the resulting immunisation strategies differ in how computationally expensive and how applicable to realworld scenarios they are. Strategies which use typical measures of centrality or the kShell index of nodes afford knowledge about the full network structure. For scenarios like information diffusion in social media, such knowledge is usually given. However, this is not the case for realworld contacts. Especially in the light of global pandemics, such as the current COVID19 crisis, it would be desirable if one could approximate the spreading capability of nodes only using information from their immediate neighbourhood, i.e. on the node level. This would greatly improve personalised warning systems, for example based on contact tracing apps, without the need for collecting personal contact information at a central organisation.
Accordingly, this article extends the results of our previous work (Krukowski and Hecking 2021) on properties of the community structure as indicators for the spreading capability of nodes and how well these can be approximated, yet providing a more extensive evaluation particularly with regard to comparison of global and local approximations.
The paper is structured as follows: In the “Background” section, we delineate the background and outline the necessary preliminaries. Related work on this topic will be described in the “Related work” section. Our global and local approaches for identifying influential spreaders in networks are explained in the “Methods” section. Evaluation results on realworld and generated networks are reported in the “Analysis” section and eventually discussed in a broader scope in the “Summary and conclusions” section.
Background
Spreading processes generally describe a flow of information between actors or members of a network (Karunakaran et al. 2017). Hence, within complex networks, spreading can only happen between adjacent nodes, which makes topological features important factors to consider when attempting to control the spreading process. For immunisation strategies, typically the origin of the diffusion process is of interest, as these so called “seeds” (Comin and Costa 2011) and their properties yield important information from which inferences regarding the efficiency of the spreading process (i.e., their spreading capability) can be drawn. For example, the degree centrality of a node is one such feature, as nodes with high degree centralities naturally have more possibilities to potentially spread information to other nodes (Albert et al. 2000). Thus, these so called “hubs” mark efficient spreaders (Erkol et al. 2019). This is also reflected by the fact that an uneven degree distribution within networks (many hubs) results in more efficient spreading (Barabasi 2016). Apart from hubs, the community structure of graphs is another important factor influencing spreading processes (Rajeh et al. 2021; Ghalmane et al. 2019a, b). Information spreads more easily within highly connected subcommunities (Stegehuis et al. 2016), and similarly, nodes who act as bridges or are members of multiple overlapping communities might also spread information more easily between communities. As such, considering the community structure can improve the prediction of the spreading process and thus the immunisation of relevant nodes (Peng et al. 2020; Ghalmane et al. 2019a).
Community structure and spreading
In this paper, we focus on this community structure of networks and examine, how the membership of nodes in different overlapping communities might help predict their spreading capability. To this end, we relate this property to other properties of community structure, specifically the kShell index of nodes.
kShell Index
Within highly cohesive subgraphs, information can spread more easily. A common notion in graph theory to calculate this cohesiveness is to determine the kCore of a network. This kCore (Dorogovtsev et al. 2006) refers to the largest induced subgraph of a network, in which all nodes have at least a k connections with others. It can be determined by successively removing nodes from the network with degree smaller k until no more nodes can be removed. The kShell index of a node then indicates the largest kCore it belongs to. Thus, nodes with a shell index of k have at least k connections to other nodes within their core, meaning that high kShell values indicate a membership within highly interconnected subgraphs where information can flow easily between all its members (see Fig. 1). It is reasonable to assume then, that a spreading process which starts within those highly interconnected subgraphs is more efficient than when the seed node is simply highly connected (i.e., has a high degree). To this end, Kitsak et al. (2010) could show, that the kShell index of a node is indeed a superior predictor for its spreading capability as opposed to its degree, specifically by sustaining infections within early stages and helping them reach a critical mass. However, nodes within these kCores also tend to exhibit multiple community memberships, which yields an additional predictor in comparison to solely taking the node’s kShell index into account. Additionally, when multiple outbreaks happen, information can spread more easily between different subcommunities, whereas for different cores, the distance between them needs to be taken into account (Kitsak et al. 2010). Thus, another connected, but distinct topological feature which might impact the spreading efficiency is the community membership of nodes.
Link communities and influential spreaders
To examine the community structure of graphs, community detection techniques such as the Louvain method (Blondel et al. 2008) can be used. The Louvain method assigns subcommunities to nodes based on high connections within a community and little connections between different subcommunities, resulting in each node getting assigned a unique subcommunity. However, especially nodes which are part of multiple overlapping and nested communities, i.e., connect groups in different social contexts, might be capable spreaders. The underlying assumption is that information, diseases, etc. mainly circulate within densely connected groups. Actors in the overlap of such groups can be infected within one group and inject the spreading processes into several other densely connected groups. Similarly, nodes in overlaps are often neighbours of highly influential nodes (i.e., hubs) within their respective communities, which allows for an even more efficient spreading. In contrast to node partitioning methods such as the one mentioned above, the Link Communities approach by Ahn et al. (2010) was especially designed to uncover communities with pervasive overlaps. Based on the assumption that social groups are better characterised as a set of closely interrelated links instead of closely interconnected nodes, the method partitions the links of a network instead of the set of nodes. As a result, subcommunities can overlap, and single nodes can be members of multiple subcommunities. The procedure of link clustering is described as follows: Edges (\(e_ik\) and \(e_jk\) ) with a common neighbour k are compared pairwise. Node k is called keystone node, while the other two nodes are called impost nodes (see Fig. 2). It should be noted, that only the neighbours of the impost nodes are taken into account for the calculation, as the neighbours of k (except the impost nodes) are of no interest. To calculate the similarity of the nodes, the similarity criterion S (Jaccard index) is applied (see Eq. 1). The set of the node i and its neighbours is denoted as \(n + i\).
For the above example in Fig. 1, this would result in \(S = \frac{1}{4}\) . A dendrogram is then built through singlelinkage hierarchical clustering and cut at a certain threshold according to the partition density, which then results in the link communities. From these link communities, the community memberships of the nodes can be derived, and thus each node is assigned a vector of community memberships, from which the actual number of communities it belongs to can be calculated.
In our recent publication (Krukowski and Hecking 2021), we could show that the above hypothesised relationship between the community membership of nodes and their spreading capability does exist, and that nodes, which are members of multiple overlapping subcommunities, do indeed prove to be influential spreaders. Details about the utilisation of the algorithm for detecting influential spreaders will be given in the “Estimating spreading capability using global information” section. Before that, we will shortly discuss related work on spreading processes and the role of the community structure.
Related work
In recent years, there has been a growing body of research on the role of community structure and how it relates to spreading processes (Cherifi et al. 2019; Tulu et al. 2018). Particularly, the calculation of centrality measures (e.g., degree, betweenness) in a differentiated manner to reflect a node’s local and global influence (Rajeh et al. 2021; Ghalmane et al. 2019b) was shown to lead to a more accurate prediction of efficient spreaders. In this regard, Ghalmane et al. showed that nodes with high local centralities (i.e., high local or withincommunity influence) seem to be especially capable spreaders in networks with a strong community structure, while those with high global centralities (i.e., high global or intercommunity influence) are more efficient in networks with a weaker community structure (Ghalmane et al. 2019b, 2018). Furthermore, network modularity, a major factor representing the community structure of networks, was shown to influence the speed of spreading processes (Peng et al. 2020), and the individual contribution of nodes to the network modularity appears to predict spreading efficiency, as nodes who act as bridges or hubs (and whose deletion would result in a different network modularity) were shown to be especially capable spreaders (modularity vitality, see Magelinski et al. 2021). Thus, many immunisation strategies based on communitystructure features of nodes exist (for an overview see Cherifi et al. 2019). These strategies differ with regard to the amount of information about the network structure they need. Communityaware centrality measures, modularity vitality and the kShell index of nodes presume knowledge of the global network structure, and the resulting immunisation strategies can be characterised as global strategies (Cherifi et al. 2019). In contrast, local immunisation strategies that do not rely on such global information, might be less computationally expensive and more applicable to realworld scenarios (Cherifi et al. 2019). However, even if immunisation occurs on the node level, most algorithms still need information that goes beyound the immediate neighbourhood of nodes. As a typical representative of such local immunisation strategies, the RandomWalk Overlap Selection (RWOS) algorithm requires a prespecified list of nodes occurring in overlaps between communities, which needs at least partial knowlege about the networks community structure. It performs a random walk on the entire network and counts how often the overlap nodes are encountered. In this regard our approach using a measure of local community centrality described in the next section is fundamentally different, since we aim to find ways how a node can assess its own spreading capability when only the immediate neighbours and the links among them are accessible. This is, for example, the case for realworld contacts collected through contact tracing apps or for users of social networking platforms who can only observe connections between their friends.
Methods
While there are good indicators that the kShell index of nodes or link communities work well for identifying influential spreaders in networks (Krukowski and Hecking 2021; Kitsak et al. 2010), the drawback of the required knowledge about the global network structure warrants strategies which allow for an immunisation of relevant nodes irrespective of such knowledge. Especially when considering that for generated or social networks, such knowledge is usually given, it becomes apparent that in realworld scenarios, the complete network with all nodes and their respective links is often unknown  especially in those cases, where the prediction of the individual spreading capability is desired. For example, during the current COVID19 crisis, a riskapproximation based only on the knowledge of the immediate neighbourhood is both highly desirable and technologically feasible (contacttracing apps).
Thus, in addition to measures which use global information to approximate spreading capability, we developed a measure which relies only on local information.
Estimating spreading capability using global information
As described above in the “Link communities and influential spreaders” section, the community membership of nodes in multiple overlapping link communities might be a good indicator for their spreading capability. To this end, we defined a new indicator for the spreading capability of nodes based on the Link Communities algorithm, which is called global community centrality (\(global\_cc\)).
However, due to the nested nature of link communities, a node can be part of many communities that share a large fraction of their nodes so that the number of communities of a node alone may not be sufficient to identify nodes that are able to inject a spreading process in several different densely connected regions of a network. Therefore, the global community centrality of a node x participating in n link communities \(C_1, C_2, \dots , C_n\) is defined as the union nodes in these communities (see Eq. 2).
This assigns high values to nodes that connect many large communities that do not share many nodes.
Estimating spreading capability using local information
As mentioned before, a drawback of global methods is that they can only be applied in usecases where one can view the entire (or large parts) of the network of interest at once.
To estimate the spreading capability of nodes with using local information of their neighbourhood only, we developed an index that approximates global community centrality. The procedure of calculating the local community centrality \((local\_{cc})\) of node x is at follows: First, an induced subgraph SG(x) containing all neighbours of x is extracted from the entire network. In order to approximate the number of communities in which ego participates, the nodes in SG are partitioned using the Louvain Method (Blondel et al. 2008). The rationale behind this is that the number of nonoverlapping communities found in the neighbourhood network of x correlates with the number of overlapping link communities in which x occurs. High values should be assigned to nodes with many well connected local communities in their neighbourhood. The local community centrality of node x is given as:
\(C_{SG(x)}\) is the set of clusters in SG(x) detected by the Louvaine Method. \(E_c\) and \(V_c\) denotes the edges and the nodes respectively present in a neighbourhood cluster \(c \in C_{SG(x)}\). Note that if there are only isolated nodes (or singlenode communities) in the SG(x), the measure reduces to the degree of x. However, if the neighbourhood of x can be partitioned into several densely connected clusters, x has a good chance to be a good spreader since it possibly is a connector of several communities on the global level.
Analysis
Modeling spreading capability
To evaluate the capability of nodes to spread information through the network, we simulated spreading processes according to wellknown SIR models (May and Lloyd 2001) (Susceptible, Infected, Recovered) using Epidemics on Networks (EoN) Python package (Miller and Ting 2019). In this evaluation the process starts with one initially infected node and all others are susceptible. This node tries to infect its susceptible neighbours and succeeds with a given infection rate (denoted as b). After that, it recovers and cannot be infected again. The resulting newly infected nodes then in turn try to infect their neighbours. The process terminates when no new infections occur. For each node, 100 of such simulations were conducted and of those, the average number of infected nodes (total infection), the maximum number of infected nodes across all simulation steps (peak infection), and the number of simulation steps until termination (duration) was measured. These measures of the true spreading capability of nodes are then compared to the spreading capability estimated by the different methods described above.
In the following, the results of the evaluation will be presented. All of the evaluations are calculated for b (infection rate) = 0.1. To increase the external and internal validity of our evaluations, we examine both realworld and artificiallygenerated networks.
The imprecision function
To quantify the importance of nodes with a high local and global community centrality during the spreading, we calculated an objective measure, namely the imprecision function. Similar to Kitsak and colleagues (Kitsak et al. 2010), this function is calculated for each of the relevant measures, and is denoted as, \(\epsilon _{degree}{(p)}\dots \epsilon _{CC\_local}{(p)}\). For each subset p of nodes (here, p refers to a specific percentage of the dataset) with the highest spreading capability (denoted as \(\phi _{eff}\)) and the highest value according the respective measure (denoted as \(\phi _{d} \dots \phi _{cc\_local}\)), the average spreading is calculated. Then, the difference in spreading between the p nodes with highest values in the respective measure and the most efficient spreaders is calculated. Formally, for \(\epsilon _{CC\_local}{(p)}\), the function is defined as follows:
By subtracting the fraction from 1, higher values correspond to more imprecision, and smaller values for \(\epsilon\) indicate less imprecision and therefore a better measure.
Realworld networks
We chose two representatives of realworld networks to evaluate different measures for predicting spreading capabilities of nodes, both representing social media data and physical encounters between people.
The first network is a sample of a friendship network from Facebook (McAuley and Leskovec 2012). The dataset was assembled from a survey on social cycles on Facebook and is made up of the union of 10 ego networks of survey participants (connections of ego with all of its neighbours + connections between the neighbours). Therefore, it is well suited for evaluation since it can be assumed that it adequately reflects a situation where a node participates in several overlapping social circles. The Facebook network is fully connected and comprises 4093 nodes and 88234 edges.
The data of the second realworld network^{Footnote 1} was collected during the 2009 SFHH (Société Française d’Hygiène Hospitalière) conference. The 403 nodes represent the participants. Each participant wore RFID (radiofrequency identification) devices for close proximity contact tracking. The edges in the network represent facetoface encounters between the participants for more than 20 seconds. In the following this network will be referred to as the SFHH network. Table 1 summarises the main properties of the network including statistics of the SIR simulations with infection rate 0.1 and 100 runs per node. The duration column refers to time steps of the simulation. It can be seen that in the smaller SFHH network a much larger proportion of nodes get infected more quickly, which is due to the smaller diameter and higher average degree.
A first observation is that there is a medium correlation between nearly all structural node properties and the spreading capability of nodes, indicating that the true spreading capability is linked to these properties (see Tables 2, 3). The only exception is the correlation of the local community centrality in the Facebook network, which appears to be only small. However, correlations alone do not provide enough insights into the utility of different immunisation strategies. Therefore, the imprecision function described in the “The imprecision function” section was calculated at different values for p (i.e. the top fraction of nodes according to the measures and true spreading capability).
Here, the results for the two realworld networks are mixed concerning the identification of top spreaders in the two networks (see Fig. 3 for the total number of infected nodes and Fig. 4 for the peak infection). For total infection (see Fig. 3), mean imprecision values across all p values are 0.02 for degree, 0.02 for kShell, 0.04 for \(global\_cc\) and 0.02 for \(local\_cc\) for the Facebook network, while for the SFHH network they are 0.06 for degree, 0.09 for kShell, 0.02 for \(global\_cc\) and 0.02 for \(local\_cc\). For peak infection (see Fig. 4), mean imprecision values across all p values are 0.06 for degree, 0.07 for kShell, 0.08 for \(global\_cc\) and 0.06 for \(local\_cc\) for Facebook, while for SFHH, they are 0.06 for degree, 0.09 for kShell, 0.02 for \(global\_cc\) and 0.02 for \(local\_cc\). Thus, judging from the mean imprecision values alone, no clear picture regarding our local and global community centrality measures emerges, although they appear to be comparable to the other measures in identifying top spreaders. Contrary to the findings by Kitsak et al. (2010), the kShell index is not superior to the degree and other measures for small values of the top fraction of spreaders p in our analysed networks. In the Facebook network, however, the differences between the measures are marginal in this regime and the kShell index appears to be superior for \(p > 0.28\). This can be attributed to the smaller variance of the spreading capability of nodes in the Facebook network (see Table 2). Furthermore, in the Facebook network there are only 75 out of 4039 nodes which have a kShell index smaller than 2, and thus, a large periphery with many starlike structures (i.e., one high degree node is connected to many nodes with low degrees) is not present in the network so that the degree of a node is a good proxy for spreading capability. In contrast to that, in the SFHH network, both the community centrality on the global (\(global\_cc\)) as well as the local level (\(local\_cc\)) clearly better identify the top spreaders compared to the degree or kShell index of nodes. It can be seen in Figs. 3 and 4 that both measures consistently show smaller imprecision values for the majority of pvalues and hence identify influential spreaders with more precision. Since this network represents a realworld contact network at an event, more nodes emerge who connect different densely connected regions of the network if they move from one group to another.
To additionally analyse how the \(local\_cc\) and \(global\_cc\) relate to each other, we generated a scatterplot which can be seen in Fig. 5. The plot shows the local and global community centrality for each node in the Facebook network. As one can see, the measures correspond to each other, especially for smaller values, confirming our intuition that the nonoverlapping communities found in the neighbourhood network of nodes correlates with the number of overlapping link communities in which they occur.
Generated networks
From the previous section it becomes clear that measures of identifying top spreaders need a differentiated consideration in relation to properties of the underlying network. To this end, we generated 8 networks of 1000 nodes according to different configurations of the ForestFire Model (Leskovec et al. 2007), as it creates networks with typical properties of realworld networks such as heavytailed degree distributions and community structure.
The model was configured in the following manner: First a forward burning probability \(p_{fb}\) has to be specified. The generator adds one node at a time and it randomly connects to one of the already exiting nodes. For each node x that gained a new edge, a random number r is sampled from a geometric distribution with mean \(p_{fb}/(1p_{fb})\). The new node then connects to r neighbours of x. The procedure continues for each newly established connection until termination. For each of such new forward burning connection, a new triangle emerges. Consequently, forward burning creates densely connected regions in the network. Since \(p_{fb}\) is chosen typically small, forward burning succeeds only for a small fraction of the neighbours of x and can propagate in different network regions that are connected by x. In this way, pervasively and nested communities emerge in a natural way, which makes this model particularly suited for our analysis. Furthermore, it is known that the Forest Fire model inherently models preferential attachments and creates communities having properties that can be observed in many realworld networks (Leskovec et al. 2009). Depending on the neighbourhood of the node x burning of only a few steps creates small and well separated communities while burning with a higher success rate creates large communities that merge with others eventually forming the network core.
We generated networks with a forwardburning probability \(p^1_{fb} = 0.05, p^2_{fb} = 0.1, p^3_{fb} = 0.15, \dots , p^8_{fb} = 0.4\). The higher the forward burning probability, the denser the networks. Moreover, the parameter controls the number of dense and overlapping communities in the network, namely smaller and more separated communities for small values of \(p_{fb}\), while for large values several communities merge into a giant component (Leskovec et al. 2007).
As can be seen in Fig. 6, the average infection rate of the nodes increases, as higher forward burning probabilities are chosen for the generation of the networks. This can on one hand be attributed to increasing density of the networks, but also to the number of emerging overlapping communities.
By plotting the imprecision function of the top p fraction of spreaders selected by the different measures for both total infection and peak infection (see Fig. 7), one can see that the imprecision generally decreases for networks generated with growing forward burning probability. This can clearly attributed to the fact that with large values for \(p_{fb}\) the networks are denser and several communities merge into a giant component during network evolution as described above. In such networks, almost every node is a good spreader and all measures perform similar. Across all p values, mean imprecision values are 0.14 for degree, 0.17 for kShell, .15 for \(global\_cc\) and .13 for \(local\_cc\). However, for networks created with smaller forward burning probability \(p_{fb} \le 0.2\) larger differences in the imprecision can be observed (0.26 for degree, 0.31 for kShell, 0.26 for \(global\_cc\) and 0.24 for \(local\_cc\)) showing that the local and global community centrality are slightly superior to the degree and definitely to the kshell index for identifying good spreaders in such networks. For those generated with forward probability \(p_{fb} > 0.2\) however, differences between the measures become marginal. This is most probably due to the fact that these networks are quite densely connected and consequently, every node has good spreading capability.
To exemplify this, Fig. 6 shows the average infection rate for each of the generated networks, along with the normalised Gini coefficient (Dorfman 1979), which was calculated for the spreading capability of nodes (measured by total and peak infection). The normalised Gini coefficient measures the skewness of a distribution (or statistical dispersion). It was originally developed for measuring the wealth inequality of a population. It is 1 if one person owns all and 0 if the wealth status is uniformly distributed over a population. The same can also be applied for the total number of infections for a SIR spreading process started at particular nodes. It can be seen that nodes with significantly higher spreading capability compared the the majority only emerge for lower values of \(p_{fb}\), which explains the little deviation between influence measures in networks generated with \(p_{fb} > 0.2\), while for the other networks, almost all nodes are good spreaders.
Summary and conclusions
In this paper, we intended to complement recent findings (Krukowski and Hecking 2021) regarding spreading processes within complex networks and the immunisation of nodes using topological features, specifically the community structure. In doing so, we approach two goals: Firstly, extend our understanding of our recently introduced measure of community centrality (\(global\_cc\)), and secondly, develop a new measure to predict the efficiency of the spreading process which can be used without knowledge of the global network structure (\(local\_cc\)). While for \(global\_cc\), the community centrality is calculated using link clustering (Ahn et al. 2010; Krukowski and Hecking 2021), for the \(local\_cc\), an induced subgraph for every node of the network is created (i.e., egonetwork), which is then clustered using the Louvainmethod (Blondel et al. 2008). The assumption is that if the neighbourhood of a node x can be clustered into several densely connected subcommunities, this is an indicator that x connects different social cycles. From the resulting number of communities, its local community centrality is assigned. We showed that this assumption is justifiable by considering the correlation between the local and global community centrality. To approach the goals of this paper, we examined both measures in relation to already established measures used to identify influential spreaders (degree, kShell). Generally, our results confirm the comparability of the \(global\_cc\) measure to the other measures in predicting a node’s spreading capability. The same applies to the newly introduced \(local\_cc\) measure, which even performs better than the \(global\_cc\) in both our examined realworld networks as well as artificially generated ones. The calculated correlation coefficients show a comparable correlation for all of the examined measures with the spreading capability, except for the \(local\_cc\) in the Facebook network. To extend this finding by objectively comparing the respective topspreaders, we calculated the imprecision function for the p top spreaders selected by different measures. For the examined realworld networks, it shows that local measures appear to be suitable predictors for small values of p in the Facebook network, while they are generally more accurate in the SFHH network, irrespective of the p value (i.e., top % of spreaders). This applies to both peak infection and total infection. However, for bigger values of p (top fraction of spreaders selected by a measure) in the Facebook network, the kShell index outperforms the other measures, although this might be attributable to the absence of starlike structures and realworld properties.
To increase external validity, we additionally analysed 8 artificially generated networks, with the generation parameter \(p_{fb}\), which leads to more communitystructure and heavytailed degree distributions as it increases. Here, along with decreasing imprecision for higher \(p_{fb}\) values (i.e., more community structure), it shows that the \(local\_cc\) even outperforms the \(global\_cc\)  for nearly all of the 8 generated networks. In conclusion, the evaluations showed two things. Firstly, they deepened our understanding regarding topological features and their influence on spreading processes by showing that the \(global\_cc\) measure is comparable to the others in our examined realworld networks. As such, it provides further evidence for the influence of community structure on spreading processes, and it confirms the importance community overlaps for spreading processes: Nodes who are in such overlaps not only appear to be more likely in the vicinity of hubs (Ghalmane et al. 2020), they might be well connected to other nodes in the subcommunity (Yang and Leskovec 2012), allowing for an efficient spreading to other parts of the network. Our results add evidence to this. Secondly, they show that for a good approximation, knowledge of the global network structure is not necessarily needed. Instead, using the \(global\_cc\) measure, spreading capability can be equally well predicted. This confirms related research on this topic, which showed the effectiveness of using local immunisation strategies that do not rely on global network structure (Kumar et al. 2018; Taghavian et al. 2017). It also shows that local information on the direct neighbourhood of nodes corresponds to aspects of the global community structure of networks (see Kudelka et al. 2019). In addition to that, as opposed to other common local immunisation strategies, our measure does not need any precalculated or groundtruth knowledge of the community structure, and instead infers such information using local information only, making it computationally more efficient as well as more applicable to realworld scenarios.
The introduction of such a measure is important: While findings regarding topological features and their relation to spreading efficiency are of high theoretical relevance, they lose practical relevance in realworld settings where knowledge of the global network structure is rarely given. Accordingly, topological features such as the kShell index, modularity or global community centrality offer little inferential value for individuals who want to assess their spreading capability but have knowledge about their immediate local network only. Yet especially in situations like the current COVID19 crisis, such local approximations of the global spreading capability of nodes could prove highly useful in personalised risk management (e.g. in contact tracing apps) for preventing infections.
Limitations and future works
The presented study has certain limitations that need to be considered in followup works. The results on the Facebook and SFHH networks presented in the “Realworld networks” section compared to the evaluation on generated networks in the “Generated networks” section give good indications under which conditions each measure for identifying top spreaders is most appropriate. Although the SFHH network represents an epidemiologically relevant network, more experiments on additional networks from different domains and with different topologies and sizes are necessary to further consolidate under which conditions each measure is most appropriate. In this regard, making use of voluntary data donations about realworld contacts as they become increasingly available constitute a promising direction. For the evaluation on artificially generated networks, in future works we aim to develop and use new models that allow for a better control for the emergence of overlapping community structures than the used forestfire model, e.g., the LFR (Lancichinetti–Fortunato–Radicchi) model (Lancichinetti et al. 2008). This would allow to investigate the proposed methods in more detail.
Availability of data and materials
The datasets used and analysed during the current study are available from the corresponding author on reasonable request.
Abbreviations
 EoN:

Epidemics on Networks python package
 Global_cc:

Global community centrality
 LFR:

Lancichinetti–Fortunato–Radicchi
 Local_cc:

Local community centrality
 RFID:

Radiofrequency identification
 RWOS:

Randomwalk overlap selection
 SFHH:

Société Française d’Hygiène Hospitalière conference
 SIR:

Susceptible, infected, recovered
References
Ahn YY, Bagrow JP, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466(7307):761–764
Albert R, Jeong H, Barabási AL (2000) Error and attack tolerance of complex networks. Nature 406(6794):378–382. https://doi.org/10.1038/35019019
Balthrop J, Forrest S, Newman MEJ, Williamson MM (2004) Technological networks and the spread of computer viruses. Science 304(5670):527–529. https://doi.org/10.1126/science.1095845
Barabasi AL (2016) Network science, 1st edn. Cambridge University Press, Cambridge
Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):10008. https://doi.org/10.1088/17425468/2008/10/P10008. arXiv: 0803.0476
Cherifi H, Palla G, Szymanski BK, Lu X (2019) On community structure in complex networks: challenges and opportunities. Appl Netw Sci 4(1):1–35. https://doi.org/10.1007/s4110901902389. Number: 1 Publisher: SpringerOpen. Accessed 20210713
Comin CH, Costa LdF (2011) Identifying the starting point of a spreading process in complex networks. Phys Rev E 84(5):056105. https://doi.org/10.1103/PhysRevE.84.056105. arXiv:1003.3256
Dorfman R (1979) A formula for the Gini coefficient. Rev Econ Stat 61(1):146–149
Dorogovtsev SN, Goltsev AV, Mendes JFF (2006) Kcore organization of complex networks. Phys Rev Lett 96(4):040601
Erkol S, Castellano C, Radicchi F (2019) Systematic comparison between methods for the detection of influential spreaders in complex networks. Sci Rep 9(1):15095. https://doi.org/10.1038/s41598019512096
Ghalmane Z, Hassouni ME, Cherifi C, Cherifi H (2018) Centrality in modular networks. arXiv:1810.05101
Ghalmane Z, Hassouni ME, Cherifi H (2019a) Immunization of networks with nonoverlapping community structure. Soc Netw Anal Min 9(1):45. https://doi.org/10.1007/s1327801905919. Accessed 20210713
Ghalmane Z, Cherifi C, Cherifi H, Hassouni ME (2019b) Centrality in complex networks with overlapping community structure. Sci Rep 9(1):10133. https://doi.org/10.1038/s4159801946507y. Bandiera_abtest: a Cc_license_type: cc_by Cg_type: Nature Research Journals Number: 1 Primary_atype: Research Publisher: Nature Publishing Group Subject_term: Applied mathematics;Computer science Subject_term_id: appliedmathematics;computerscience. Accessed 20210713
Ghalmane Z, Cherifi C, Cherifi H, Hassouni ME (2020) Exploring hubs and overlapping nodes interactions in modular complex networks. IEEE Access 8:79650–79683. https://doi.org/10.1109/ACCESS.2020.2991001. Conference Name: IEEE Access
Guille A, Hacid H, Favre C, Zighed DA (2013) Information diffusion in online social networks: a survey. ACM SIGMOD Rec 42(2):17–28. https://doi.org/10.1145/2503792.2503797
Karunakaran RK, Manuel S, Narayanan Satheesh E (2017) Spreading information in complex networks: an overview and some modified methods. Graph Theory Adv Algorithms Appl. https://doi.org/10.5772/intechopen.69204
Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining. KDD ’03. Association for Computing Machinery, New York, NY, USA pp 137–146. https://doi.org/10.1145/956750.956769
Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888–893
Krukowski S, Hecking T (2021) Using link clustering to detect influential spreaders. In: Benito RM, Cherifi C, Cherifi H, Moro E, Rocha LM, SalesPardo M (eds) Complex networks & their applications IX. Springer, Cham, pp 408–419
Kudelka M, Ochodkova E, Zehnalova S, Plesnik J (2019) Egozones: nonsymmetric dependencies reveal network groups with large and dense overlaps. Appl Netw Sci 4(1):1–49. https://doi.org/10.1007/s4110901901926. Number: 1 Publisher: SpringerOpen. Accessed 20210713
Kumar M, Singh A, Cherifi H (2018) An efficient immunization strategy using overlapping nodes and its neighborhoods. In: Companion proceedings of the the web conference 2018. WWW ’18. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE. pp 1269–1275 https://doi.org/10.1145/3184558.3191566
Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E. https://doi.org/10.1103/physreve.78.046110
Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1:2
Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: natural cluster sizes and the absence of large welldefined clusters. Internet Math 6(1):29–123
Magelinski T, Bartulovic M, Carley KM (2021) Measuring node contribution to community structure with modularity vitality. IEEE Trans Netw Sci Eng 8(1):707–723. https://doi.org/10.1109/TNSE.2020.3049068. arXiv:2003.00056. Accessed 20210713
May RM, Lloyd AL (2001) Infection dynamics on scalefree networks. Phys Rev E 64(6):066112
McAuley J, Leskovec J (2012) Learning to discover social circles in ego networks. In: Proceedings of the 25th international conference on neural information processing systems—volume 1. NIPS’12. Curran Associates Inc., Red Hook, NY, USA. pp 539–547
Miller JC, Ting T (2019) Eon (epidemics on networks): a fast, flexible python package for simulation, analytic approximation, and analysis of epidemics on networks. J Open Sour Softw 4(44):1731. https://doi.org/10.21105/joss.01731
Nowzari C, Preciado VM, Pappas GJ (2016) Analysis and control of epidemics: a survey of spreading processes on complex networks. IEEE Control Syst Mag 36(1):26–46. https://doi.org/10.1109/MCS.2015.2495000
PastorSatorras R, Vespignani A (2001) Epidemic spreading in scalefree networks. Phys Rev Lett 86:3200–3203. https://doi.org/10.1103/PhysRevLett.86.3200
Peng H, Nematzadeh A, Romero DM, Ferrara E (2020) Network modularity controls the speed of information diffusion. Phys Rev E 102(5):052316. https://doi.org/10.1103/PhysRevE.102.052316. Publisher: American Physical Society. Accessed 20210713
Rajeh S, Savonnet M, Leclercq E, Cherifi H (2021) Characterizing the interactions between classical and communityaware centrality measures in complex networks. Sci Rep 11(1):10088. https://doi.org/10.1038/s4159802189549x. Bandiera_abtest: a Cc_license_type: cc_by Cg_type: Nature Research Journals Number: 1 Primary_atype: Research Publisher: Nature Publishing Group Subject_term: Mathematics and computing;Physics Subject_term_id: mathematicsandcomputing;physics. Accessed 20210713
Stegehuis C, van der Hofstad R, van Leeuwaarden JSH (2016) Epidemic spreading on complex networks with community structures. Sci Rep 6:29748. https://doi.org/10.1038/srep29748
Taghavian F, Salehi M, Teimouri M (2017) A local immunization strategy for networks with overlapping community structure. Physica A 467:148–156. https://doi.org/10.1016/j.physa.2016.10.014. ccessed 20210713
Tulu MM, Hou R, Younas T (2018) Identifying influential nodes based on community structure to speed up the dissemination of information in complex network. IEEE Access 6:7390–7401. https://doi.org/10.1109/ACCESS.2018.2794324. Conference Name: IEEE Access
Wu F, Huberman BA, Adamic LA, Tyler JR (2004) Information flow in social groups. Physica A 337(1–2):327–335
Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the stateoftheart and comparative study. ACM Comput Surv. https://doi.org/10.1145/2501654.2501657
Yang J, Leskovec J (2012) Structure and overlaps of communities in networks. arXiv:1205.6228 [physics]. Accessed 20210713
Acknowledgements
Not applicable.
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Affiliations
Contributions
SK and TH contributed equally to the research concept, development of methodology, validation of results as well as the writing and editing of the manuscript. TH ran the simulations and developed the methods needed to produce the data for analysis. SK performed the main parts of the evaluation. Both authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Krukowski, S., Hecking, T. Global and local community memberships for estimating spreading capability of nodes in social networks. Appl Netw Sci 6, 84 (2021). https://doi.org/10.1007/s41109021004213
Received:
Accepted:
Published:
Keywords
 Spreading
 Networks
 Link clustering
 Community structure