Riemannian-geometric entropy for measuring network complexity
Anno: 2016
Autori: Franzosi R., Felice D., Mancini S., Pettini M.
Affiliazione autori: QSTAR, Largo Enr Fermi 2, I-50125 Florence, Italy; INO CNR, Largo Enr Fermi 2, I-50125 Florence, Italy; Univ Camerino, Sch Sci & Technol, I-62032 Camerino, Italy; Ist Nazl Fis Nucl, Sez Perugia, Via A Pascoli, I-06123 Perugia, Italy; Aix Marseille Univ, Marseille, France; CNRS, Ctr Phys Theor, UMR7332, F-13288 Marseille, France.
Abstract: A central issue in the science of complex systems is the quantitative characterization of complexity. In the present work we address this issue by resorting to information geometry. Actually we propose a constructive way to associate with a-in principle, any-network a differentiable object (a Riemannian manifold) whose volume is used to define the entropy. The effectiveness of the latter in measuring network complexity is successfully proved through its capability of detecting a classical phase transition occurring in both random graphs and scale-free networks, as well as of characterizing small exponential random graphs, configuration models, and real networks.
Giornale/Rivista: PHYSICAL REVIEW E
Volume: 93 (6) Da Pagina: 062317-1 A: 062317-11
Maggiori informazioni: We are indebted to R. Quax for providing us with data on power-law random graphs. We also thank M. Rasetti for useful discussions. This work was supported by the Seventh Framework Programme for Research of the European Commission under FET-Proactive Grant TOPDRIM (FP7-ICT-318121).Parole chiavi: Entropy; Geometry; Graph theory, Configuration model; Geometric entropy; Information geometry; Network complexity; Quantitative characterization; Random graphs; Real networks; Riemannian manifold, Complex networksDOI: 10.1103/PhysRevE.93.062317Citazioni: 10dati da “WEB OF SCIENCE” (of Thomson Reuters) aggiornati al: 2025-05-18Riferimenti tratti da Isi Web of Knowledge: (solo abbonati) Link per visualizzare la scheda su IsiWeb: Clicca quiLink per visualizzare la citazioni su IsiWeb: Clicca qui