{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:13:21Z","timestamp":1760242401962,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T00:00:00Z","timestamp":1498780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministerio de Econom\u00eda y Competitividad, Spain","award":["MTM2015-67396-P"],"award-info":[{"award-number":["MTM2015-67396-P"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e19070321","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T10:04:58Z","timestamp":1498817098000},"page":"321","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Entropy Characterization of Random Network Models"],"prefix":"10.3390","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1217-1216","authenticated-orcid":false,"given":"Pedro","family":"Zufiria","sequence":"first","affiliation":[{"name":"Departamento Matem\u00e1tica Aplicada a las TIC, ETSI Telecomunicaci\u00f3n, Universidad Polit\u00e9cnica de Madrid, E-28040 Madrid, Spain"},{"name":"Information Processing and Telecommunications Center (IPTC), Universidad Polit\u00e9cnica de Madrid, E-28040 Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iker","family":"Barriales-Valbuena","sequence":"additional","affiliation":[{"name":"Departamento Matem\u00e1tica Aplicada a las TIC, ETSI Telecomunicaci\u00f3n, Universidad Polit\u00e9cnica de Madrid, E-28040 Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,6,30]]},"reference":[{"key":"ref_1","unstructured":"Barab\u00e1si, A.L., and Frangos, J. (2014). Linked: The New Science of Networks Science of Networks, Basic Books."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u201csmall-world\u201d networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_4","unstructured":"Dorogovtsev, S.N., and Mendes, J.F. (2013). Evolution of Networks: From Biological Nets to the Internet and WWW, Oxford University Press."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"7332","DOI":"10.1073\/pnas.0610245104","article-title":"Structure and tie strengths in mobile communication networks","volume":"104","author":"Onnela","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/35036627","article-title":"The large-scale organization of metabolic networks","volume":"407","author":"Jeong","year":"2000","journal-title":"Nature"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., and Faloutsos, C. (1999). On Power-Law Relationships of the Internet Topology, ACM.","DOI":"10.1145\/316188.316229"},{"key":"ref_8","unstructured":"Chen, Q., Chang, H., Govindan, R., and Jamin, S. (2002, January 23\u201327). The origin of power laws in Internet topologies revisited. Proceedings of the INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, New York, NY, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Albert","year":"1999","journal-title":"Science"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s100510050359","article-title":"How popular is your paper? An empirical study of the citation distribution","volume":"4","author":"Redner","year":"1998","journal-title":"Eur. Phys. J. B Condens. Matter Complex Syst."},{"key":"ref_11","first-page":"343","article-title":"On the evolution of random graphs","volume":"38","author":"Erdos","year":"1961","journal-title":"Bull. Inst. Int. Stat."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1257\/aer.97.3.890","article-title":"Meeting strangers and friends of friends: How random are social networks?","volume":"93","author":"Jackson","year":"2007","journal-title":"Am. Econ. Rev."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Herrera, C., and Zufiria, P.J. (2011, January 22\u201324). Generating scale-free networks with adjustable clustering coefficient via random walks. Proceedings of the 2011 IEEE Workshop Network Science, West Point, NY, USA.","DOI":"10.1109\/NSW.2011.6004642"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erdos","year":"1959","journal-title":"Publ. Math. Debr."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0109045","article-title":"Random plane networks","volume":"9","author":"Gilbert","year":"1961","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"258702","DOI":"10.1103\/PhysRevLett.89.258702","article-title":"Scale-free networks from varying vertex intrinsic fitness","volume":"89","author":"Caldarelli","year":"2002","journal-title":"Phys. Rev. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"036112","DOI":"10.1103\/PhysRevE.68.036112","article-title":"Class of correlated random networks with hidden variables","volume":"68","year":"2003","journal-title":"Phys. Rev. E"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"066702","DOI":"10.1103\/PhysRevE.66.066702","article-title":"Range-dependent random graphs and their application to modeling large small-world proteome datasets","volume":"66","author":"Grindrod","year":"2002","journal-title":"Phys. Rev. E"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"056122","DOI":"10.1103\/PhysRevE.70.056122","article-title":"Models of social networks based on social distance attachment","volume":"70","author":"Arenas","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_20","first-page":"985","article-title":"Kronecker graphs: An approach to modeling networks","volume":"11","author":"Leskovec","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Bhamidi, S., Bresler, G., and Sly, A. (2008, January 25\u201328). Mixing time of exponential random graphs. Proceedings of the IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201908), Philadelphia, PA, USA.","DOI":"10.1109\/FOCS.2008.75"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1080\/01621459.1986.10478342","article-title":"Markov graphs","volume":"81","author":"Frank","year":"1986","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1214\/13-AOS1155","article-title":"Estimating and understanding exponential random graph models","volume":"41","author":"Chatterjee","year":"2013","journal-title":"Ann. Stat."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Lusher, D., Koskinen, J., and Robins, G. (2012). Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511894701"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","article-title":"Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images","volume":"6","author":"Geman","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1111\/j.2517-6161.1974.tb00999.x","article-title":"Spatial interaction and the statistical analysis of lattice systems","volume":"36","author":"Besag","year":"1974","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","article-title":"A stochastic approximation method","volume":"22","author":"Robbins","year":"1951","journal-title":"Ann. Math. Stat."},{"key":"ref_28","first-page":"1","article-title":"Markov chain Monte Carlo estimation of exponential random graph models","volume":"3","author":"Snijders","year":"2002","journal-title":"J. Soc. Struct."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"28005","DOI":"10.1209\/0295-5075\/81\/28005","article-title":"The entropy of randomized network ensembles","volume":"81","author":"Bianconi","year":"2007","journal-title":"Europhys. Lett."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"036114","DOI":"10.1103\/PhysRevE.79.036114","article-title":"Entropy of network ensembles","volume":"79","author":"Bianconi","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Orsini, C., Dankulov, M.M., Jamakovic, A., Mahadevan, P., Colomer-de, S.P., Vahdat, A., Bassler, K.E., Toroczkai, Z., Bogu\u00f1\u00e1, M., and Caldarelli, G. (2015). Quantifying randomness in real network. Nat. Commun., 8627.","DOI":"10.1038\/ncomms9627"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/584091.584093","article-title":"A mathematical theory of communication","volume":"5","author":"Shannon","year":"2001","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"4177","DOI":"10.1088\/0256-307X\/25\/11\/093","article-title":"Network entropy based on topology configuration and its computation to random networks","volume":"25","author":"Ji","year":"2008","journal-title":"Chin. Phys. Lett."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","article-title":"Assortative mixing in networks","volume":"89","author":"Newman","year":"2002","journal-title":"Phys. Rev. Lett."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Sol\u00e9, R., and Valverde, S. (2004). Information Theory of Complex Networks: On Evolution and Architectural Constraints, Springer.","DOI":"10.1007\/978-3-540-44485-5_9"},{"key":"ref_36","unstructured":"Mahdi, K., Safar, M., and Sorkhoh, I. (2008, January 9\u201312). Entropy of robust social networks. Proceedings of the IADIS International Conference E-Society, Algarve, Portugal."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/7\/321\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:41:00Z","timestamp":1760208060000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/7\/321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,30]]},"references-count":36,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2017,7]]}},"alternative-id":["e19070321"],"URL":"https:\/\/doi.org\/10.3390\/e19070321","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2017,6,30]]}}}