Identifying Influential Nodes in Bipartite Networks Using the Clustering Coefficient
classification
💻 cs.SI
physics.soc-ph
keywords
nodesinfluentialnetworkbipartiteclusteringcoefficientcommunityaccount
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.