arXiv:0709.2074 [cond-mat.dis-nn]AbstractReferencesReviewsResources
Generalized entropies and open random and scale-free networks
Published 2007-09-13Version 1
We propose the concept of open network as an arbitrary selection of nodes of a large unknown network. Using the hypothesis that information of the whole network structure can be extrapolated from an arbitrary set of its nodes, we use Renyi mutual entropies in different q-orders to establish the minimum critical size of a random set of nodes that represents reliably the information of the main network structure. We also identify the clusters of nodes responsible for the structure of their containing network.
Comments: talk at CTNEXT07 (July 2007)
DOI: 10.1063/1.2828754
Keywords: scale-free networks, open random, generalized entropies, large unknown network, main network structure
Tags: journal article
Related articles: Most relevant | Search more
arXiv:0705.1547 [cond-mat.dis-nn] (Published 2007-05-10)
Numerical evaluation of the upper critical dimension of percolation in scale-free networks
Trading interactions for topology in scale-free networks
C. V. Giuraniuc, J. P. L. Hatchett, J. O. Indekeu, M. Leone, I. Perez Castillo, B. Van Schaeybroeck, C. Vanderzande
Velocity and hierarchical spread of epidemic outbreaks in scale-free networks