pith. sign in

arxiv: 1710.06367 · v3 · pith:7MODMD5Enew · submitted 2017-10-17 · 🧮 math.SP · cs.NA· math.CO· math.NA

On the spectrum of directed uniform and non-uniform hypergraphs

Anirban Banerjee , Arnab Char This is my paper
classification 🧮 math.SP cs.NAmath.COmath.NA
keywords directedhypergraphsconnectivityuniformgeneralnon-uniformspectralbetter
0
0 comments X
read the original abstract

Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs also hold for general directed uniform hypergraphs. Our representation of a connectivity tensor will be very useful for the further development in spectral theory of directed hypergraphs. At the end, we have also introduced the concept of weak* irreducible hypermatrix to better explain connectivity of a directed hypergraph.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Framework for Directed Hypergraph Signal Processing via tensor t-SVD

    cs.LG 2026-06 unverdicted novelty 7.0

    DHGSP extends graph signal processing to directed hypergraphs via t-SVD, defining adjacency tensor, shift operator, and t-DHGFT, outperforming baselines in traffic denoising.