Network geometry
Networks are finite metric spaces, with distances defined by the shortest paths between
nodes. However, this is not the only form of network geometry: two others are the geometry …
nodes. However, this is not the only form of network geometry: two others are the geometry …
Mercator: uncovering faithful hyperbolic embeddings of complex networks
We introduce Mercator, a reliable embedding method to map real complex networks into
their hyperbolic latent geometry. The method assumes that the structure of networks is well …
their hyperbolic latent geometry. The method assumes that the structure of networks is well …
Geometric description of clustering in directed networks
First-principle network models are crucial to understanding the intricate topology of real
complex networks. Although modelling efforts have been quite successful in undirected …
complex networks. Although modelling efforts have been quite successful in undirected …
Detecting the ultra low dimensionality of real networks
Reducing dimension redundancy to find simplifying patterns in high-dimensional datasets
and complex networks has become a major endeavor in many scientific fields. However …
and complex networks has become a major endeavor in many scientific fields. However …
Geometric renormalization unravels self-similarity of the multiscale human connectome
Structural connectivity in the brain is typically studied by reducing its observation to a single
spatial resolution. However, the brain possesses a rich architecture organized over multiple …
spatial resolution. However, the brain possesses a rich architecture organized over multiple …
The D-Mercator method for the multidimensional hyperbolic embedding of real networks
One of the pillars of the geometric approach to networks has been the development of model-
based mapping tools that embed real networks in its latent geometry. In particular, the tool …
based mapping tools that embed real networks in its latent geometry. In particular, the tool …
Emergence of geometric turing patterns in complex networks
Turing patterns, arising from the interplay between competing species of diffusive particles,
have long been an important concept for describing nonequilibrium self-organization in …
have long been an important concept for describing nonequilibrium self-organization in …
Characterizing the analogy between hyperbolic embedding and community structure of complex networks
We show that the community structure of a network can be used as a coarse version of its
embedding in a hidden space with hyperbolic geometry. The finding emerges from a …
embedding in a hidden space with hyperbolic geometry. The finding emerges from a …
An anomalous topological phase transition in spatial random graphs
Clustering–the tendency for neighbors of nodes to be connected–quantifies the coupling of
a complex network to its latent metric space. In random geometric graphs, clustering …
a complex network to its latent metric space. In random geometric graphs, clustering …
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 …
science, statistical physics, applied mathematics, computer science, sociology, and other …