Clustering as a measure of the local topology of networks
Alexandre H. Abdo, A. P. S. de Moura
Abstract
Usual formulations of the clustering coefficient can be shown to be insufficient in the task of describing the local topology of very simple networks. Motivated by this, we review some alternatives in order to present an extension, the clustering profile. We show, both conceptually and through applications to well studied networks, that this measure is a more complete and robust measure of clustering. It imposes stringent constraints on theoretical growth models, specially on aspects of the network structure that play a central role in dynamics on networks. In addition, we study how it provides a richer perspective of phenomena such as hierarchy, small-worlds and clusterization.
Create a lesson
Related papers
Multivariate amplitude analysis of the cascade particle decays based on the Nearest Neighbors fitting
I. V. Yeletskikh, A. O. Vasyukov
The geometry of uncertainty decomposition in profile-likelihood fits
Rafael Coelho Lopes de Sá
Statistical validation of calorimeter inpainting with generative diffusion priors
Himanshu Raj, Roli Esha
Unknown Unknowns: Model Misspecification in Machine Learning for Physics
Juan Cruz-Martinez, Carolina Cuesta-Lazaro, Alexander Held et al.
Exploring new directions in enhancing the ACTS parameter optimization suite
Chance LaVoie, Qi Bin Lei, Rocky Bala Garg et al.
Analytically Consistent Reconstruction of Finite Data Using Padé Sequences
Emerson Díaz, Balma Duch, Pere Masjuan