Journal
JOURNAL OF COMPLEX NETWORKS
Volume 7, Issue 4, Pages 469-490Publisher
OXFORD UNIV PRESS
DOI: 10.1093/comnet/cny036
Keywords
Graph embedding; Geometry of graphs; Laplacian matrix; Simplex geometry
Categories
Funding
- Alan Turing Institute under the EPSRC [EP/N510129/1]
Ask authors/readers for more resources
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 uniqueway. 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available