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 …

Real-world networks, like social networks or the internet infrastructure, have structural
properties such as large clustering coefficients that can best be described in terms of an …

We introduce in network geometry a measure of geometrical congruence (GC) to evaluate
the extent a network topology follows an underlying geometry. This requires finding all …

Real networks comprise from hundreds to millions of interacting elements and permeate all
contexts, from technology to biology to society. All of them display non-trivial connectivity …

In Chung-Lu random graphs, a classic model for real-world networks, each vertex is
equipped with a weight drawn from a power-law distribution, and two vertices form an edge …

Real-world networks, like social networks or the internet infrastructure, have structural
properties such as large clustering coefficients that can best be described in terms of an …

Scale-free percolation is a stochastic model for complex networks. In this spatial random
graph model, vertices are linked by an edge with probability depending on independent and …

Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with
underlying geometry. We study bootstrap percolation on these graphs, which is a process …

A standard approach to accelerating shortest path algorithms on networks is the
bidirectional search, which explores the graph from the start and the destination …

The key requirement to routing in any telecommunication network, and especially in Internet-
of-Things (IoT) networks, is scalability. Routing must route packets between any source and …