Small worlds and clustering in spatial networks
Networks with underlying metric spaces attract increasing research attention in network science, statistical physics, applied mathematics, computer science, sociology, and other fields. This attention is further amplified by the current surge of activity in graph embedding. In the vast realm of spat...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2020 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/170875 |
| Acesso em linha: | https://hdl.handle.net/11441/170875 https://doi.org/10.1103/PhysRevResearch.2.023040 |
| Access Level: | acceso abierto |
| Palavra-chave: | Clustering Degree correlations Degree distributions Network formation & growth |
| Resumo: | Networks with underlying metric spaces attract increasing research attention in network science, statistical physics, applied mathematics, computer science, sociology, and other fields. This attention is further amplified by the current surge of activity in graph embedding. In the vast realm of spatial network models, only a few reproduce even the most basic properties of real-world networks. Here, we focus on three such properties—sparsity, small worldness, and clustering—and identify the general subclass of spatial homogeneous and heterogeneous network models that are sparse small worlds and that have nonzero clustering in the thermodynamic limit. We rely on the maximum entropy approach in which network links correspond to noninteracting fermions whose energy depends on spatial distances between nodes. |
|---|