Identifying key nodes is crucial for accelerating or impeding dynamic spreading in a network. Community-aware centrality measures tackle this problem by exploiting the community structure of a network. Although there is a growing trend to design new community-aware centrality measures, there is no systematic investigation of the proposed measures' effectiveness. This study performs an extensive comparative evaluation of prominent community-aware centrality measures using the Susceptible-Infected-Recovered (SIR) model on real-world online social networks. Overall, results show that K-shell with Community and Community-based Centrality measures are the most accurate in identifying influential nodes under a single-spreader problem. Additionally, the epidemic transmission rate doesn't significantly affect the behavior of the community-aware centrality measures.
Centrality measures are crucial in quantifying the influence of the members of a social network. Although there has been a great deal of work dealing with this issue, the vast majority of classical centrality measures are agnostic of the community structure characterizing many social networks. Recent works have developed community-aware centrality measures that exploit features of the community structure information encountered in most real-world complex networks. In this paper, we investigate the interactions between 5 popular classical centrality measures and 5 community-aware centrality mea…
Unlike classical centrality measures, recently developed community-aware centrality measures use a network's community structure to identify influential nodes in complex networks. This paper investigates their relationship on a set of fifty real-world networks originating from various domains. Results show that classical and community-aware centrality measures generally exhibit low to medium correlation values. These results are consistent across networks. Transitivity and efficiency are the most influential macroscopic network features driving the correlation variation between classical and c…
Targeting influential nodes in complex networks allows fastening or hindering rumors, epidemics, and electric blackouts. Since communities are prevalent in real-world networks, community-aware centrality measures exploit this information to target influential nodes. Researches show that they compare favorably with classical measures that are agnostic about the community structure. Although the diffusion process is of prime importance, previous studies consider mainly the famous Susceptible-Infected-Recovered (SIR) epidemic propagation model. This work investigates the consistency of previous a…
Several centrality measures have been formulated to quantify the notion of 'importance' of actors in social networks. Current measures scrutinize either local or global connectivity of the nodes and have been found to be inadequate for social networks. Ignoring hierarchy and community structure, which are inherent in all human social networks, is the primary cause of this inadequacy. Positional hierarchy and embeddedness of an actor in the community are intuitively crucial determinants of his importance. The theory of social capital asserts that an actor's importance is derived from his positi…
Community-aware centrality is an emerging research area in network science concerned with the importance of nodes in relation to community structure. Measures are a function of a network's structure and a given partition. Previous approaches extend classical centrality measures to account for community structure with little connection to community detection theory. In contrast, we propose cluster-quality vitality measures, i.e., modularity vitality, a community-aware measure which is well-grounded in both centrality and community detection theory. Modularity vitality quantifies positive and ne…
Identifying vital nodes in networks exhibiting a community structure is a fundamental issue. Indeed, community structure is one of the main properties of real-world networks. Recent works have shown that community-aware centrality measures compare favorably with classical measures agnostic about this ubiquitous property. Nonetheless, there is no clear consensus about how they relate and in which situation it is better to use a classical or a community-aware centrality measure. To this end, in this paper, we perform an extensive investigation to get a better understanding of the relationship be…
The computational demands of community detection algorithms such as Louvain and spectral optimization can be prohibitive for large networks. Eigenvector centrality and Katz centrality are two network statistics commonly used to describe the relative importance of nodes; and their calculation can be closely approximated on large networks by scalable iterative methods. In this paper, we present and leverage a surprising relationship between Katz centrality and eigenvector centrality to detect communities. Beyond the computational gains, we demonstrate that our approach identifies communities tha…
To measure node importance, network scientists employ centrality scores that typically take a microscopic or macroscopic perspective, relying on node features or global network structure. However, traditional centrality measures such as degree centrality, betweenness centrality, or PageRank neglect the community structure found in real-world networks. To study node importance based on network flows from a mesoscopic perspective, we analytically derive a community-aware information-theoretic centrality score based on network flow and the coding principles behind the map equation: map equation c…
Influential nodes play a critical role in boosting or curbing spreading phenomena in complex networks. Numerous centrality measures have been proposed for identifying and ranking the nodes according to their importance. Classical centrality measures rely on various local or global properties of the nodes. They do not take into account the network community structure. Recently, a growing number of researches have shifted to community-aware centrality measures. Indeed, it is a ubiquitous feature in a vast majority of real-world networks. In the literature, the focus is on designing community-awa…
Identifying important nodes in complex networks is essential in theoretical and applied fields. A small number of such nodes have deterministic power to decide information spreading, so it is of importance to find a set of nodes that maximize the propagation in networks. Based on baseline ranking methods, various improved methods were proposed, but there does not exist one enhanced method that covers all the base methods. In this paper, we propose a penalized method called RCD-Map, which is short for resampling community detection to maximize propagation, on five baseline ranking methods(Degre…
Network data is usually not error-free, and the absence of some nodes is a very common type of measurement error. Studies have shown that the reliability of centrality measures is severely affected by missing nodes. This paper investigates the reliability of centrality measures when missing nodes are likely to belong to the same community. We study the behavior of five commonly used centrality measures in uniform and scale-free networks in various error scenarios. We find that centrality measures are generally more reliable when missing nodes are likely to belong to the same community than in …
Identifying influential nodes in a network is a fundamental issue due to its wide applications, such as accelerating information diffusion or halting virus spreading. Many measures based on the network topology have emerged over the years to identify influential nodes such as Betweenness, Closeness, and Eigenvalue centrality. However, although most real-world networks are modular, few measures exploit this property. Recent works have shown that it has a significant effect on the dynamics on networks. In a modular network, a node has two types of influence: a local influence (on the nodes of it…
In this paper, we proposed a novel two-stage optimization method for network community partition, which is based on inherent network structure information. The introduced optimization approach utilizes the new network centrality measure of both links and vertices to construct the key affinity description of the given network, where the direct similarities between graph nodes or nodal features are not available to obtain the classical affinity matrix. Indeed, such calculated network centrality information presents the essential structure of network, hence, the proper measure for detecting netwo…
Understanding the network structure, and finding out the influential nodes is a challenging issue in the large networks. Identifying the most influential nodes in the network can be useful in many applications like immunization of nodes in case of epidemic spreading, during intentional attacks on complex networks. A lot of research is done to devise centrality measures which could efficiently identify the most influential nodes in the network. There are two major approaches to the problem: On one hand, deterministic strategies that exploit knowledge about the overall network topology in order …
Community detection is a significant and challenging task in network research. Nowadays, plenty of attention has been focused on local methods of community detection. Among them, community detection with a greedy algorithm typically starts from the identification of local essential nodes called central nodes of the network; communities expand later from these central nodes by optimizing a modularity function. In this paper, we propose a new central node indicator and a new modularity function. Our central node indicator, which we call local centrality indicator (LCI), is as efficient as the we…
The influence maximization problem is trying to identify a set of K nodes by which the spread of influence, diseases, or information is maximized. The optimization of influence by finding such a set is an NP-hard problem and a key issue in analyzing complex networks. In this paper, a new greedy and hybrid approach based on a community detection algorithm and a MADM technique (TOPSIS) is proposed to cope with the problem, called, Greedy TOPSIS and Community-Based (GTaCB) algorithm. The paper concisely introduces community detection and the TOPSIS technique, then it presents the pseudo-code of t…
Network analysis is an important tool in understanding the behavior of complex systems of interacting entities. However, due to the limitations of data gathering technologies, some interactions might be missing from the network model. This is a ubiquitous problem in all domains that use network analysis, from social networks to hyper-linked web networks to biological networks. Consequently, an important question in analyzing networks is to understand how increasing the noise level (i.e. percentage of missing edges) affects different network parameters. In this paper we evaluate the effect of n…
It is of paramount importance to uncover influential nodes to control diffusion phenomena in a network. In recent works, there is a growing trend to investigate the role of the community structure to solve this issue. Up to now, the vast majority of the so-called community-aware centrality measures rely on non-overlapping community structure. However, in many real-world networks, such as social networks, the communities overlap. In other words, a node can belong to multiple communities. To overcome this drawback, we propose and investigate the "Overlapping Modularity Vitality" centrality measu…
In this work, we analyse and predict the stability of communities in complex networks. We use a variant of closeness centrality, known as profile closeness, to measure the loyalty of a member towards its community. We show that the profile closeness is an adequate indicator of how communities evolve in a network. We investigate this in static as well as dynamic (temporal) networks and establish the relevance of profile closeness in predicting the evolution of a complex network. Keywords: Small world networks , Centrality , Community , Closeness , Clustering
Centrality in Collaboration: A Novel Algorithm for Social Partitioning Gradients in Community Detection for Multiple Oncology Clinical Trial Enrollments
University of Toronto（多伦多大学）；University Health Network（大学健康网络）
The world around us consists of objects that have different relationships with each other. The result of these communications is various networks, part of which are bipartite networks. While many studies have investigated essential network members, less attention has been paid to the bipartite graphs. On the other hand, one of the most critical aspects of network analysis is the detection and extraction of communities that arise in the structure of networks. For these reasons, we have introduced a measure called H.H to identify influential nodes in community formation in the one-mode projectio…
Nowadays, identification and detection community structures in complex networks is an important factor in extracting useful information from networks. Label propagation algorithm with near linear-time complexity is one of the most popular methods for detecting community structures, yet its uncertainty and randomness is a defective factor. Merging LPA with other community detection metrics would improve its accuracy and reduce instability of LPA. Considering this point, in this paper we tried to use edge betweenness centrality to improve LPA performance. On the other hand, calculating edge betw…
Centrality is an important notion in complex networks; it could be used to characterize how influential a node or an edge is in the network. It plays an important role in several other network analysis tools including community detection. Even though there are a small number of axiomatic frameworks associated with this notion, the existing formalizations are not generic in nature. In this paper we propose a generic axiomatic framework to capture all the intrinsic properties of a centrality measure (a.k.a. centrality index). We analyze popular centrality measures along with other novel measures…
Summary: The ModuLand plug-in provides Cytoscape users an algorithm for determining extensively overlapping network modules. Moreover, it identifies several hierarchical layers of modules, where meta-nodes of the higher hierarchical layer represent modules of the lower layer. The tool assigns module cores, which predict the function of the whole module, and determines key nodes bridging two or multiple modules. The plug-in has a detailed JAVA-based graphical interface with various colouring options. The ModuLand tool can run on Windows, Linux, or Mac OS. We demonstrate its use on protein struc…
The non-backtracking matrix and its eigenvalues have many applications in network science and graph mining, such as node and edge centrality, community detection, length spectrum theory, graph distance, and epidemic and percolation thresholds. Moreover, in network epidemiology, the reciprocal of the largest eigenvalue of the non-backtracking matrix is a good approximation for the epidemic threshold of certain network dynamics. In this work, we develop techniques that identify which nodes have the largest impact on the leading non-backtracking eigenvalue. We do so by studying the behavior of th…
Node centrality is one of the integral measures in network analysis with wide range of applications from socio-economic to personalized recommendation. We argue that an effective centrality measure should undertake stability even under information loss or noise introduced in the network. With six local information based centrality metric, we investigate the effect of varying assortativity while keeping degree distribution unchanged, using networks with scale free and exponential degree distribution. This model provides a novel scope to analyze stability of centrality metric which can further f…
In this paper, we analyze a major part of the research output of the Networked Knowledge Organization Systems (NKOS) community in the period 2000 to 2016 from a network analytical perspective. We focus on the papers presented at the European and U.S. NKOS workshops and in addition four special issues on NKOS in the last 16 years. For this purpose, we have generated an open dataset, the "NKOS bibliography" which covers the bibliographic information of the research output. We analyze the co-authorship network of this community which results in 123 papers with a sum of 256 distinct authors. We us…
A variety of metrics have been proposed to measure the relative importance of nodes in a network. One of these, alpha-centrality [Bonacich, 2001], measures the number of attenuated paths that exist between nodes. We introduce a normalized version of this metric and use it to study network structure, specifically, to rank nodes and find community structure of the network. Specifically, we extend the modularity-maximization method [Newman and Girvan, 2004] for community detection to use this metric as the measure of node connectivity. Normalized alpha-centrality is a powerful tool for network an…
In this work, we explore four common algorithms for community detection in networks, namely Agglomerative Hierarchical Clustering, Divisive Hierarchical Clustering (Girvan-Newman), Fastgreedy and the Louvain Method. We investigate their mechanics and compare their differences in terms of implementation and results of the clustering behavior on a standard dataset. We further propose some enhancements to these algorithms that show promising results in our evaluations, such as self-neighboring for Neighbor Matrix constructions, a deterministic slightly faster version of the Louvain Method that fa…
Corporations across the world are highly interconnected in a large global network of corporate control. This paper investigates the global board interlock network, covering 400,000 firms linked through 1,700,000 edges representing shared directors between these firms. The main focus is on the concept of centrality, which is used to investigate the embeddedness of firms from a particular country within the global network. The study results in three contributions. First, to the best of our knowledge for the first time we can investigate the topology as well as the concept of centrality in corpor…
Facial appearance matters in social networks. Individuals frequently make trait judgments from facial clues. Although these face-based impressions lack the evidence to determine validity, they are of vital importance, because they may relate to human network-based social behavior, such as seeking certain individuals for help, advice, dating, and cooperation, and thus they may relate to centrality in social networks. However, little to no work has investigated the apparent facial traits that influence network centrality, despite the large amount of research on attributions of the central positi…
A deep community in a graph is a connected component that can only be seen after removal of nodes or edges from the rest of the graph. This paper formulates the problem of detecting deep communities as multi-stage node removal that maximizes a new centrality measure, called the local Fiedler vector centrality (LFVC), at each stage. The LFVC is associated with the sensitivity of algebraic connectivity to node or edge removals. We prove that a greedy node/edge removal strategy, based on successive maximization of LFVC, has bounded performance loss relative to the optimal, but intractable, combin…
In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the k-paths. This technique allows to efficiently compute a edge ranking in large networks in near linear time. Once the centrality ranking is calculated, the algorithm computes the pairwise proximity between nodes of the network. Finally, it discovers the community structure adopting a strategy inspired by the well-known state…
Betweenness centrality is a fundamental centrality measure in social network analysis. Given a large-scale network, how can we find the most central nodes? This question is of key importance to numerous important applications that rely on betweenness centrality, including community detection and understanding graph vulnerability. Despite the large amount of work on designing scalable approximation algorithms for betweenness centrality, estimating it on large-scale networks remains a computational challenge. In this paper, we study the Betweenness Centrality Maximization problem: given a graph …
In this paper we compare the social network structure of people talking about Crohn's disease, Cystic Fibrosis, and Type 1 diabetes on Facebook and Twitter. We find that the Crohn's community's contributors are most emotional on Facebook and Twitter and most negative on Twitter, while the T1D community's communication network structure is most cohesive.
We perform an extensive analysis of how sampling impacts the estimate of several relevant network measures. In particular, we focus on how a sampling strategy optimized to recover a particular spectral centrality measure impacts other topological quantities. Our goal is on one hand to extend the analysis of the behavior of TCEC [Ruggeri2019], a theoretically-grounded sampling method for eigenvector centrality estimation. On the other hand, to demonstrate more broadly how sampling can impact the estimation of relevant network properties like centrality measures different than the one aimed at o…
In this work we look at the structure of the influences between Western art painters as revealed by their biographies on Wikipedia. We use a modified version of modularity maximisation with metadata to detect a partition of artists into communities based on their artistic genre and school in which they belong. We then use this community structure to discuss how influential artists reached beyond their own communities and had a lasting impact on others, by proposing modifications on standard centrality measures.
Community structure is an important area of research. It has received a considerable attention from the scientific community. Despite its importance, one of the key problems in locating information about community detection is the diverse spread of related articles across various disciplines. To the best of our knowledge, there is no current comprehensive review of recent literature which uses a scientometric analysis using complex networks analysis covering all relevant articles from the Web of Science (WoS). Here we present a visual survey of key literature using CiteSpace. The idea is to id…
In our recent works, we developed a probabilistic framework for structural analysis in undirected networks and directed networks. The key idea of that framework is to sample a network by a symmetric and asymmetric bivariate distribution and then use that bivariate distribution to formerly defining various notions, including centrality, relative centrality, community, and modularity. The main objective of this paper is to extend the probabilistic definition to attributed networks, where sampling bivariate distributions by exponentially twisted sampling. Our main finding is that we find a way to…
The spectrum of the non-backtracking matrix plays a crucial role in determining various structural and dynamical properties of networked systems, ranging from the threshold in bond percolation and non-recurrent epidemic processes, to community structure, to node importance. Here we calculate the largest eigenvalue of the non-backtracking matrix and the associated non-backtracking centrality for uncorrelated random networks, finding expressions in excellent agreement with numerical results. We show however that the same formulas do not work well for many real-world networks. We identify the mec…
We propose a new method for aggregating the information of multiple reviewers rating multiple products. Our approach is based on the network relations induced between products by the rating activity of the reviewers. We show that our method is algorithmically implementable even for large numbers of both products and consumers, as is the case for many online sites. Moreover, comparing it with the simple average, which is mostly used in practice, and with other methods previously proposed in the literature, it performs very well under various dimension, proving itself to be an optimal trade--off…
With the logistic challenges faced by most countries for the production, distribution, and application of vaccines for the novel coronavirus disease~(COVID-19), social distancing~(SD) remains the most tangible approach to mitigate the spread of the virus. To assist SD monitoring, several tech companies have made publicly available anonymized mobility data. In this work, we conduct a multi-objective mobility reduction rate comparison between the first and second COVID-19 waves in several localities from America and Europe using Google community mobility reports~(CMR) data. Through multi-dimensi…
Complex network theory (CNT) is gaining a lot of attention in the scientific community, due to its capability to model and interpret an impressive number of natural and anthropic phenomena. One of the most active CNT field concerns the evaluation of the centrality of vertices and edges in the network. Several metrics have been proposed, but all of them share a topological point of view, namely centrality descends from the local or global connectivity structure of the network. However, vertices can exhibit their own intrinsic relevance independent from topology; e.g., vertices representing stra…
We develop a new sampling method to estimate eigenvector centrality on incomplete networks. Our goal is to estimate this global centrality measure having at disposal a limited amount of data. This is the case in many real-world scenarios where data collection is expensive, the network is too big for data storage capacity or only partial information is available. The sampling algorithm is theoretically grounded by results derived from spectral approximation theory. We studied the problem on both synthetic and real data and tested the performance comparing with traditional methods, such as rando…
Finding a small subset of influential nodes to maximise influence spread in a complex network is an active area of research. Different methods have been proposed in the past to identify a set of seed nodes that can help achieve a faster spread of influence in the network. This paper combines driver node selection methods from the field of network control, with the divide-and-conquer approach of using community structure to guide the selection of candidate seed nodes from the driver nodes of the communities. The use of driver nodes in communities as seed nodes is a comparatively new idea. We id…
In recent era, networks of data are growing massively and forming a shape of complex structure. Data scientists try to analyze different complex networks and utilize these networks to understand the complex structure of a network in a meaningful way. There is a need to detect and identify such a complex network in order to know how these networks provide communication means while using the complex structure. Social network analysis provides methods to explore and analyze such complex networks using graph theories, network properties and community detection algorithms. In this paper, an analysi…
We study the structural properties of large scale collaboration in online communities of innovation and the role that position in the community plays in determining knowledge contribution. Contrary to previous research, we argue for a more local perspective when examining online collaboration. We demonstrate that a member's centrality and spanning within his/her local neighborhood is a better predictor of contribution than global centrality and spanning within the whole community. We contribute both theoretically and methodologically to research on large scale collaboration. On the theoretical…
A community within a network is a group of vertices densely connected to each other but less connected to the vertices outside. The problem of detecting communities in large networks plays a key role in a wide range of research areas, e.g. Computer Science, Biology and Sociology. Most of the existing algorithms to find communities count on the topological features of the network and often do not scale well on large, real-life instances. In this article we propose a strategy to enhance existing community detection algorithms by adding a pre-processing step in which edges are weighted according …
Targeting the right group of workers for crowdsourcing often achieves better quality results. One unique example of targeted crowdsourcing is seeking community-situated workers whose familiarity with the background and the norms of a particular group can help produce better outcome or accuracy. These community-situated crowd workers can be recruited in different ways from generic online crowdsourcing platforms or from online recovery communities. We evaluate three different approaches to recruit generic and community-situated crowd in terms of the time and the cost of recruitment, and the accu…
The identification of influential nodes in complex network can be very challenging. If the network has a community structure, centrality measures may fail to identify the complete set of influential nodes, as the hubs and other central nodes of the network may lie inside only one community. Here we define a bipartite clustering coefficient that, by taking differently structured clusters into account, can find important nodes across communities.
