Analysis method of nodes similarity with multi-layer adjacency entropy
From MaRDI portal
Publication:3380919
DOI10.7641/CTA.2021.00463zbMATH Open1499.90049MaRDI QIDQ3380919FDOQ3380919
Authors: Guanghui Yan, Ning Zhou, Xiao-Gang Wang
Publication date: 29 September 2021
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
Deterministic network models in operations research (90B10) Measures of information, entropy (94A17) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cited In (4)
- A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes
- Measure the structure similarity of nodes in complex networks based on relative entropy
- 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)