Gosztolai, AdamArnaudon, Alexis2021-09-112021-09-112021-09-112021-07-2710.1038/s41467-021-24884-1https://infoscience.epfl.ch/handle/20.500.14299/181279WOS:000683367300024Describing networks geometrically through low-dimensional latent metric spaces has helped design efficient learning algorithms, unveil network symmetries and study dynamical network processes. However, latent space embeddings are limited to specific classes of networks because incompatible metric spaces generally result in information loss. Here, we study arbitrary networks geometrically by defining a dynamic edge curvature measuring the similarity between pairs of dynamical network processes seeded at nearby nodes. We show that the evolution of the curvature distribution exhibits gaps at characteristic timescales indicating bottleneck-edges that limit information spreading. Importantly, curvature gaps are robust to large fluctuations in node degrees, encoding communities until the phase transition of detectability, where spectral and node-clustering methods fail. Using this insight, we derive geometric modularity to find multiscale communities based on deviations from constant network curvature in generative and real-world networks, significantly outperforming most previous methods. Our work suggests using network geometry for studying and controlling the structure of and information spreading on networks. The analysis of networks and network processes can require low-dimensional representations, possible for specific structures only. The authors propose a geometric formalism which allows to unfold the mechanisms of dynamical processes propagation in various networks, relevant for control and community detection.Multidisciplinary SciencesScience & Technology - Other Topicsmetric-measure-spacescommunity structurecomplexdiffusioncontagiongeometrytext::journal::journal article::research article