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 complexes, is here extended to cell-complexes formed by subsequently gluing different copies of an arbitrary regular polytope. We reveal the interplay between complexity and geometry of the higher order networks generated by the model by studying the emergent community structure and the degree distribution as a function of the regular polytope forming its building blocks. Additionally we discuss the underlying hyperbolic nature of the emergent geometry and we relate the spectral dimension of the higher-order network to the dimension and nature of its building blocks.
Recommendations
- Higher-order networks. An introduction to simplicial complexes
- Quantifying networks complexity from information geometry viewpoint
- The higher-order spectrum of simplicial complexes: a renormalization group approach
- What Are Higher-Order Networks?
- Networks beyond pairwise interactions: structure and dynamics
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Apollonian circle packings: Geometry and group theory. I: The Apollonian group
- Clique topology reveals intrinsic geometric structure in neural correlations
- Collective dynamics of `small-world' networks
- Colored discrete spaces. Higher dimensional combinatorial maps and quantum gravity
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Emergence of Scaling in Random Networks
- Emergent network modularity
- Exponential random simplicial complexes
- Fast unfolding of communities in large networks
- Forman curvature for complex networks
- Forman-Ricci flow for change detection in large dynamic data sets
- Network science. With Márton Pósfai
- Networks. An introduction.
- Ollivier-Ricci curvature and the spectrum of the normalized graph Laplace operator
- Persistent homology of collaboration networks
- Random Simplicial Complexes
- Random walks on graphs: ideas, techniques and results
- Ricci curvature and eigenvalue estimate on locally finite graphs
- Ricci curvature of graphs
- Topology of random 2-complexes
- Topology of random clique complexes
Cited in
(16)- The spectral dimension of simplicial complexes: a renormalization group theory
- Complex quantum networks: a topical review
- Three Types of Network Complexity Pyramid
- Geometry, Topology and Simplicial Synchronization
- Random recursive hypergraphs
- What Are Higher-Order Networks?
- Higher-order networks. An introduction to simplicial complexes
- The mass of simple and higher-order networks
- THE ROLE OF GEOGRAPHY AND TRAFFIC IN THE STRUCTURE OF COMPLEX NETWORKS
- The phases of large networks with edge and triangle constraints
- Quantum statistics in network geometry with fractional flavor
- Contagion in simplicial complexes
- Growing simplicial complex with face dimension selection and preferential attachment
- The higher-order spectrum of simplicial complexes: a renormalization group approach
- Consensus on simplicial complexes: results on stability and synchronization
- Dynamical systems defined on simplicial complexes: symmetries, conjugacies, and invariant subspaces
This page was built for publication: Network geometry and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756544)
