Related papers: Multilinear Hyperquiver Representations
Graph representation learning has made major strides over the past decade. However, in many relational domains, the input data are not suited for simple graph representations as the relationships between entities go beyond pairwise…
We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…
In this paper, I characterize four particular classes of directed multigraphs, or quivers, as images under left and right adjoints to the natural vertex and edge functors. In particular, the following notions coincide: (1) independent sets…
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…
Graph representations of solid state materials that encode only interatomic distance lack geometrical resolution, resulting in degenerate representations that may map distinct structures to equivalent graphs. Here we propose a hypergraph…
In this paper we obtain an explicit formula for the number of hypersurfaces in a compact complex manifold X (passing through the right number of points), that has a simple node, a cusp or a tacnode. The hypersurfaces belong to a linear…
This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…
We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed…
We consider tensors in the Hierarchical Tucker format and suppose the tensor data to be distributed among several compute nodes. We assume the compute nodes to be in a one-to-one correspondence with the nodes of the Hierarchical Tucker…
The singular cubical homology theory for the category of quivers or digraphs can be constructed similarly to the classical singular homology theory for topological spaces. The case of digraphs and quivers differs from the topological case…
We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm…
It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…
In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…
HyperBagGraphs (hb-graphs as short) extend hypergraphs by allowing the hyperedges to be multisets. Multisets are composed of elements that have a multiplicity. When this multiplicity has positive integer values, it corresponds to non…
We prove delocalization of eigenvectors of vertex-transitive graphs via elementary estimates of the spectral projector. We recover in this way known results which were formerly proved using representation theory. Similar techniques show…
A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices…
Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be…
Let V be the representation of the quantised enveloping algebra of a general linear group which is the q-analogue of the vector representation. In this paper we construct a basis of the representations obtained by tensoring copies of V and…
We present a novel approach for computing a variant of eigenvector centrality for multilayer networks with inter-layer constraints on node importance. Specifically, we consider a multilayer network defined by multiple edge-weighted,…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…