The Simplex Geometry of Graphs

Abstract

Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods, each of which highlights the properties of graphs in a unique way. Here, we discuss a novel approach to study graphs: the simplex geometry (a simplex is a generalized triangle). This perspective, proposed by Miroslav Fiedler, introduces techniques from (simplex) geometry into the field of graph theory and conversely, via an exact correspondence. We introduce this graph-simplex correspondence, identify a number of basic connections between graph characteristics and simplex properties, and suggest some applications as example.

References in corpus (2)

• Hyperbolic Geometry of Complex Networks
• Self-similarity of complex networks and hidden metric spaces

Cited by in corpus (11)

• Random walks on hypergraphs
• Intralayer and interlayer synchronization in multiplex network with higher-order interactions
• GLEE: Geometric Laplacian Eigenmap Embedding
• Random walks in time-varying networks with memory
• Effective resistance is more than distance: Laplacians, Simplices and the Schur complement
• Non-linear network dynamics with consensus-dissensus bifurcation
• Impact of directionality on the emergence of Turing patterns on m-directed higher-order structures
• Constructing Laplacian matrices with Soules vectors: inverse eigenvalue problem and applications
• Edge corona product as an approach to modeling complex simplical networks
• Casting graph isomorphism as a point set registration problem using a simplex embedding and sampling
• Community structures in simplicial complexes: an application to wildlife corridor designing in Central India -- Eastern Ghats landscape complex, India