Networks with the Smallest Average Distance and the Largest Average Clustering - Quantitative Biology > Molecular NetworksReportar como inadecuado




Networks with the Smallest Average Distance and the Largest Average Clustering - Quantitative Biology > Molecular Networks - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We describe the structure of the graphs with the smallest average distanceand the largest average clustering given their order and size. There is usuallya unique graph with the largest average clustering, which at the same time hasthe smallest possible average distance. In contrast, there are many graphs withthe same minimum average distance, ignoring their average clustering. The formof these graphs is shown with analytical arguments. Finally, we measure thesensitivity to rewiring of this architecture with respect to the clusteringcoefficient, and we devise a method to make these networks more robust withrespect to vertex removal.



Autor: Dionysios Barmpoutis, Richard M. Murray

Fuente: https://arxiv.org/







Documentos relacionados