Entropy Characterization of Random Network Models
Open Access
Abstract
This paper elaborates on the Random Network Model (RNM) as a mathematical framework for modelling and analyzing the generation of complex networks. Such framework allows the analysis of the relationship between several network characterizing features (link density, clustering coefficient, degree distribution, connectivity, etc.) and entropy-based complexity measures, providing new insight on the generation and characterization of random networks. Some theoretical and computational results illustrate the utility of the proposed framework.Keywords
Funding Information
- Ministerio de Economía y Competitividad, Spain (MTM2015-67396-P)
This publication has 29 references indexed in Scilit:
- Structure and tie strengths in mobile communication networksProceedings of the National Academy of Sciences, 2007
- Meeting Strangers and Friends of Friends: How Random Are Social Networks?American Economic Review, 2007
- Class of correlated random networks with hidden variablesPhysical Review E, 2003
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Range-dependent random graphs and their application to modeling large small-world Proteome datasetsPhysical Review E, 2002
- Scale-Free Networks from Varying Vertex Intrinsic FitnessPhysical Review Letters, 2002
- The large-scale organization of metabolic networksNature, 2000
- How popular is your paper? An empirical study of the citation distributionThe European Physical Journal B, 1998
- Collective dynamics of ‘small-world’ networksNature, 1998
- Random Plane NetworksJournal of the Society for Industrial and Applied Mathematics, 1961