4 ms·
Not sure if “it” refers to this particular package or hyper graphs in general. Simplicial complexes are widely used in mathematics for many decades and they are
by ABeeSea 5y ago
Not sure if “it” refers to this particular package or hyper graphs in general. Simplicial complexes are widely used in mathematics for many decades and they are simply hyper graphs where every subset of an edge is an edge. So take the tetrahedron, for example. If (x1, x2, x3) are connected by a hyperedge (technically one of the triangular faces of the tetrahedron), then (x1,x2), (x1,x3) and (x2,x3) are also hyperedges (the lines bordering the tetrahedron face). A general hypergraph removes the subsets of edges are edges property.
- gspr 5y agoAnd for simplicial complexes there's a neat data structure: https://arxiv.org/abs/2001.02581 https://arxiv.org/abs/2001.02581 It's implemented (minus some features) in e.g. GUDHI.
- jesuslop 5y agoInteresting and saved. Some time ago I wanted to say that if I can represent a graph as an adjacency matrix, then I would have liked to say that an hypergraph is given by an adjacency tensor. I searched for that but couldn't find any previous work in this line.