The simplex geometry of graphs

DOI10.1093/COMNET/CNY036zbMATH Open1472.05113arXiv1807.06475OpenAlexW2883500076WikidataQ128639701 ScholiaQ128639701MaRDI QIDQ4958765FDOQ4958765

Authors: Karel Devriendt, Piet Van Mieghem 

Publication date: 15 September 2021

Published in: Journal of Complex Networks (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1807.06475

Recommendations

• Matrices and graphs in geometry
• scientific article; zbMATH DE number 6157492
• Linear algebra approach to geometric graphs
• Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
• Simplicial complexes of graphs

zbMATH Keywords

Laplacian matrixgraph embeddingsimplex geometrygeometry of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Euclidean analytic geometry (51N20) Polyhedra and polytopes; regular figures, division of spaces (51M20) Real and complex geometry (51M99)

Cited In (11)

• From compositional data to a Euclidean geometry on the simplex
• On pseudo-average value on graphical simplices and pseudo-inequalities
• Matrices and graphs in geometry
• Pattern Formation on Hypergraphs
• Simplicial complexes of graphs
• Effective resistance is more than distance: Laplacians, simplices and the Schur complement
• Nonlinear network dynamics with consensus-dissensus bifurcation
• From combinatorics to geometry: the dynamics of graph gradient diffusion
• Title not available (Why is that?)
• Intralayer and interlayer synchronization in multiplex network with higher-order interactions
• Co-eigenvector graphs

This page was built for publication: The simplex geometry of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958765)