The simplex geometry of graphs

DOI10.1093/COMNET/CNY036MaRDI QIDQ4958765zbMATH OpenOpenAlexWikidataFDO

Authors Karel Devriendt, Piet Van Mieghem

Publication date 15 September 2021

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

Full work available at URL https://arxiv.org/abs/1807.06475, http://resolver.tudelft.nl/uuid:06ab4063-b69c-4658-b928-0e17b4b022ac

zbMATH Keywords

geometry of graphsgraph embeddingLaplacian matrixsimplex geometry

Mathematics Subject Classification ID

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

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.

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

Cited in

(14)

• Nonlinear network dynamics with consensus-dissensus bifurcation
• Effective resistance is more than distance: Laplacians, simplices and the Schur complement
• Simplicial complexes of graphs
• From compositional data to a Euclidean geometry on the simplex
• Matrices and graphs in geometry
• scientific article; zbMATH DE number 6157492 (Why is no real title available?)
• Pattern Formation on Hypergraphs
• Co-eigenvector graphs
• Intralayer and interlayer synchronization in multiplex network with higher-order interactions
• On pseudo-average value on graphical simplices and pseudo-inequalities
• From combinatorics to geometry: the dynamics of graph gradient diffusion
• Kemeny's constant and the Lemoine point of a simplex
• A system model of three-body interactions in complex networks: consensus and conservation
• Eigenvectors and eigenvalues of the effective resistance matrix of a graph

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)