Analysis method of nodes similarity with multi-layer adjacency entropy

DOI10.7641/CTA.2021.00463MaRDI QIDQ3380919zbMATH OpenFDO

Authors Guanghui Yan, Ning Zhou, Xiao-Gang Wang

Publication date 29 September 2021

zbMATH Keywords

complex networkrelative entropyinformation entropynodes similarity

Mathematics Subject Classification ID

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

Recommendations

• Node similarity measuring in complex networks with relative entropy
• 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
• Framework based on communicability to measure the similarity of nodes in complex networks

Cited in

(4)

• 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
• Node similarity measuring in complex networks with relative entropy
• Information loss method to measure node similarity in networks

This page was built for publication: Analysis method of nodes similarity with multi-layer adjacency entropy

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