A new measure of identifying influential nodes: efficiency centrality
From MaRDI portal
Publication:2005232
Recommendations
- A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
- A new method for identifying influential nodes and important edges in complex networks
- A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
Cites work
- A NEW MEASURE OF RANK CORRELATION
- A faster algorithm for betweenness centrality*
- A new method for comparing rankings through complex networks: model and analysis of competitiveness of major European soccer leagues
- Collective dynamics of `small-world' networks
- Complex networks: structure and dynamics
- Deng entropy
- Embedding even cycles on folded hypercubes with conditional faulty edges
- Enhancing user privacy in SARG04-based private database query protocols
- Induced generalized Choquet aggregating operators with linguistic information and their application to multiple attribute decision making based on the intelligent computing
- Ranking the spreading ability of nodes in complex networks based on local structure
- STACS 2005
- Sensor data fusion based on a new conflict measure
- Statistical mechanics of complex networks
- Structural properties of the Chinese air transportation multilayer network
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- The centrality index of a graph
Cited in
(31)- M-centrality: identifying key nodes based on global position and local degree variation
- Identifying influential nodes in complex networks based on AHP
- Location of facility based on simulated annealing and ``ZKW algorithms
- \(p\)-means centrality
- CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy
- Dynamical analysis of an SE2IR information propagation model in social networks
- Ranking the spreading ability of nodes in complex networks based on local structure
- Identifying critical nodes in complex networks based on neighborhood information
- A note on the interpretation of the efficiency centrality
- Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks
- Measure the structure similarity of nodes in complex networks based on relative entropy
- A new method for identifying influential nodes and important edges in complex networks
- Node similarity measuring in complex networks with relative entropy
- A measure of identifying influential community based on the state of critical functionality
- An efficient forecasting method for time series based on visibility graph and multi-subgraph similarity
- New Centrality Measures in Networks
- An evidential link prediction method and link predictability based on Shannon entropy
- Influential nodes ranking in complex networks: an entropy-based approach
- A novel method for forecasting time series based on directed visibility graph and improved random walk
- Efficiency centrality in time-varying graphs
- A centrality measure in dense networks based on two-way random walk betweenness
- The use of nodes attributes in social network analysis with an application to an international trade network
- A novel method for forecasting time series based on fuzzy logic and visibility graph
- A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks
- Mining important nodes in directed weighted complex networks
- Density centrality: identifying influential nodes based on area density formula
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
- A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- A new evidential methodology of identifying influential nodes in complex networks
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
This page was built for publication: A new measure of identifying influential nodes: efficiency centrality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005232)
