Node similarity measuring in complex networks with relative entropy

DOI10.1016/J.CNSNS.2019.104867MaRDI QIDQ2206597zbMATH OpenOpenAlexWikidataFDO

Authors Tao Wen, Shuyu Duan, Wen Jiang

Publication date 22 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.2019.104867

zbMATH Keywords

complex networknode similarityrelative entropyTsallis entropy

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Measures of information, entropy (94A17)

Recommendations

• Measure the structure similarity of nodes in complex networks based on relative entropy
• A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes
• Information loss method to measure node similarity in networks
• Analysis method of nodes similarity with multi-layer adjacency entropy
• Framework based on communicability to measure the similarity of nodes in complex networks

Cites work

• A correlation coefficient for belief functions
• A new measure of identifying influential nodes: efficiency centrality
• A new status index derived from sociometric analysis
• A novel visibility graph transformation of time series into weighted networks
• An information dimension of weighted complex networks
• D number theory based game-theoretic framework in adversarial decision making under a fuzzy environment
• Detecting early-warning signals in periodically forced systems with noise
• Dynamical patterns of epidemic outbreaks in complex heterogeneous networks
• Evidential identification of influential nodes in network of networks
• General decay synchronization of complex multi-links time-varying dynamic network
• Identifying influential nodes based on fuzzy local dimension in complex networks
• Information mining in weighted complex networks with nonlinear rating projection
• Maximal entropy coverings and the information dimension of a complex network
• Measure the structure similarity of nodes in complex networks based on relative entropy
• Minimal partition coverings and generalized dimensions of a complex network
• Non-monotonicity of the generalized dimensions of a complex network
• On Information and Sufficiency
• Optimal control of an SIVRS epidemic spreading model with virus variation based on complex networks
• Possible generalization of Boltzmann-Gibbs statistics.
• Similarity-based classification in partially labeled networks
• Statistical physics of vaccination
• The Structure and Function of Complex Networks

Cited in

(8)

• Information loss method to measure node similarity in networks
• A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes
• A generalized gravity model for influential spreaders identification in complex networks
• Identifying influential spreaders in complex networks based on improved k-shell method
• Measure the structure similarity of nodes in complex networks based on relative entropy
• Exploring the heterogeneity for node importance byvon Neumann entropy
• Framework based on communicability to measure the similarity of nodes in complex networks
• Analysis method of nodes similarity with multi-layer adjacency entropy

This page was built for publication: Node similarity measuring in complex networks with relative entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2206597)