A new measure of identifying influential nodes: efficiency centrality

DOI10.1016/j.cnsns.2016.11.008OpenAlexW2556609853WikidataQ57852075 ScholiaQ57852075MaRDI QIDQ2005232

Yuxian Du, Yong Deng, Sha-sha Wang

Publication date: 7 October 2020

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2016.11.008

zbMATH Keywords

complex networksnetwork efficiencysusceptible-infected-recovered modelinfluential nodesefficiency centrality

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (19)

Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition ⋮ Identifying influential nodes in complex networks based on AHP ⋮ An evidential link prediction method and link predictability based on Shannon entropy ⋮ The use of nodes attributes in social network analysis with an application to an international trade network ⋮ Measure the structure similarity of nodes in complex networks based on relative entropy ⋮ GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks ⋮ CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy ⋮ Mining important nodes in directed weighted complex networks ⋮ A new evidential methodology of identifying influential nodes in complex networks ⋮ A novel method for forecasting time series based on fuzzy logic and visibility graph ⋮ \(p\)-means centrality ⋮ Node similarity measuring in complex networks with relative entropy ⋮ A note on the interpretation of the efficiency centrality ⋮ Efficiency centrality in time-varying graphs ⋮ A centrality measure in dense networks based on two-way random walk betweenness ⋮ Location of facility based on simulated annealing and ``ZKW algorithms ⋮ Dynamical analysis of an SE2IR information propagation model in social networks ⋮ An efficient forecasting method for time series based on visibility graph and multi-subgraph similarity ⋮ A novel method for forecasting time series based on directed visibility graph and improved random walk

Uses Software

• Algorithm 97

Cites Work

• Embedding even cycles on folded hypercubes with conditional faulty edges
• Structural properties of the Chinese air transportation multilayer network
• Enhancing user privacy in SARG04-based private database query protocols
• Ranking the spreading ability of nodes in complex networks based on local structure
• Sensor data fusion based on a new conflict measure
• Complex networks: structure and dynamics
• Deng entropy
• The centrality index of a graph
• 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
• Statistical mechanics of complex networks
• Induced generalized Choquet aggregating operators with linguistic information and their application to multiple attribute decision making based on the intelligent computing
• Collective dynamics of ‘small-world’ networks
• STACS 2005
• A NEW MEASURE OF RANK CORRELATION
• THE TREATMENT OF TIES IN RANKING PROBLEMS

This page was built for publication: A new measure of identifying influential nodes: efficiency centrality