Network Geometry and Complexity
Daan Mulder, Ginestra Bianconi

TL;DR
This paper explores the relationship between the geometric structure and complexity of higher order networks, using a non-equilibrium model to analyze emergent community structures, degree distributions, and hyperbolic geometry in cell-complexes built from regular polytopes.
Contribution
It extends the Network Geometry with Flavor model to cell-complexes formed by regular polytopes and analyzes their emergent geometric and complex network properties.
Findings
Emergent community structure varies with the polytope used.
Degree distribution depends on the regular polytope's properties.
The network exhibits hyperbolic geometric features.
Abstract
Higher order networks are able to characterize data as different as functional brain networks, protein interaction networks and social networks beyond the framework of pairwise interactions. Most notably higher order networks include simplicial complexes formed not only by nodes and links but also by triangles, tetrahedra, etc. More in general, higher-order networks can be cell-complexes formed by gluing convex polytopes along their faces. Interestingly, higher order networks have a natural geometric interpretation and therefore constitute a natural way to explore the discrete network geometry of complex networks. Here we investigate the rich interplay between emergent network geometry of higher order networks and their complexity in the framework of a non-equilibrium model called Network Geometry with Flavor. This model, originally proposed for capturing the evolution of simplicial…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
