Analysis of network by generalized mutual entropies
arXiv:0709.0929 · doi:10.1016/j.physa.2008.01.005
Abstract
Generalized mutual entropy is defined for networks and applied for analysis of complex network structures. The method is tested for the case of computer simulated scale free networks, random networks, and their mixtures. The possible applications for real network analysis are discussed.
References in corpus (6)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Finding and evaluating community structure in networks
- Detecting fuzzy community structures in complex networks with a Potts model
- On Renyi entropies characterizing the shape and the extension of the phase space representation of quantum wave functions in disordered systems
- Principles of statistical mechanics of random networks
Cited by in corpus (4)
- Multiresolution community detection for megascale networks by information-based replica correlations
- A Network Analysis Approach to fMRI Condition-Specific Functional Connectivity
- Community Detection in Complex Networks by Dynamical Simplex Evolution
- Generalized entropies and open random and scale-free networks