Network Null Model based on Maximal Entropy and the Rich-Club
arXiv:1210.2211
Abstract
We present a method to construct a network null-model based on the maximum entropy principle and where the restrictions that the rich-club and the degree sequence impose are conserved. We show that the probability that two nodes share a link can be described with a simple probability function. The null-model closely approximates the assortative properties of the network.
11 pages, 4 figures
References in corpus (8)
- Finding community structure in networks using the eigenvectors of matrices
- Reaction-diffusion processes and metapopulation models in heterogeneous networks
- The Rich-Club Phenomenon In The Internet Topology
- Entropy measures for complex networks: Toward an information theory of complex topologies
- The entropy of network ensembles
- The entropic origin of disassortativity in complex networks
- VIP-club phenomenon: emergence of elites and masterminds in social networks
- Redundancy and Robustness of the AS-level Internet topology and its models