期刊
JOURNAL OF COMPLEX NETWORKS
卷 7, 期 4, 页码 469-490出版社
OXFORD UNIV PRESS
DOI: 10.1093/comnet/cny036
关键词
Graph embedding; Geometry of graphs; Laplacian matrix; Simplex geometry
资金
- Alan Turing Institute under the EPSRC [EP/N510129/1]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据