Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Scalable Tensor Methods for Nonuniform Hypergraphs

Journal Article · · SIAM Journal on Mathematics of Data Science
DOI:https://doi.org/10.1137/23m1584472· OSTI ID:2396271
While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $$r$$, where $$n$$ is the number of vertices and $$r$$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $$r$$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.
Research Organization:
Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
Grant/Contract Number:
AC05-76RL01830
OSTI ID:
2396271
Report Number(s):
PNNL-SA--186918
Journal Information:
SIAM Journal on Mathematics of Data Science, Journal Name: SIAM Journal on Mathematics of Data Science Journal Issue: 2 Vol. 6; ISSN 2577-0187
Publisher:
Society for Industrial and Applied Mathematics (SIAM)Copyright Statement
Country of Publication:
United States
Language:
English

References (32)

The Expression of a Tensor or a Polyadic as a Sum of Products journal April 1927
Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials journal July 1996
Clustering categorical data: an approach based on dynamical systems journal February 2000
Numerical optimization for symmetric tensor decomposition journal April 2015
Spectra, Euclidean representations and clusterings of hypergraphs journal July 1993
Spectra of general hypergraphs journal April 2017
Gram mates, sign changes in singular values, and isomorphism journal July 2022
Adjacency energy of hypergraphs journal September 2022
Modularity and projection of bipartite networks journal July 2020
The dual-projection approach for two-mode networks journal May 2013
SciPy 1.0: fundamental algorithms for scientific computing in Python journal February 2020
Community Detection in General Hypergraph Via Graph Embedding journal January 2022
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs journal January 2002
Filtering higher-order datasets journal February 2024
An algorithm for the machine calculation of complex Fourier series journal May 1965
Hypergraphx: a library for higher-order network analysis journal April 2023
Two-mode networks exhibiting data loss journal August 2017
Random walks on hypergraphs journal February 2020
Generative hypergraph clustering: From blockmodels to modularity journal July 2021
Tensor Decompositions and Applications journal August 2009
Finding the Largest Eigenvalue of a Nonnegative Tensor journal January 2010
Shifted Power Method for Computing Tensor Eigenpairs journal October 2011
The Spacey Random Walk: A Stochastic Process for Higher-Order Data journal January 2017
Three Hypergraph Eigenvector Centralities journal January 2019
Computing Tensor $Z$-Eigenvectors with Dynamical Systems journal January 2019
Estimating Higher-Order Moments Using Symmetric Tensor Decomposition journal January 2020
On the Best Rank-1 and Rank-( R 1 , R 2 ,. . ., R N ) Approximation of Higher-Order Tensors journal January 2000
Hypernetwork science via high-order hypergraph walks journal June 2020
generatingfunctionology reference-book January 2005
The signless Laplacian matrix of hypergraphs journal May 2022
XGI: A Python package for higher-order interaction networks journal May 2023
HyperNetX: A Python package for modeling complex network data as hypergraphs journal March 2024

Similar Records

A Scalable Parallel Hypergraph Generator (HyGen)
Conference · Sat Aug 01 00:00:00 EDT 2020 · OSTI ID:1651312

Fast Parallel Tensor Times Same Vector for Hypergraphs
Conference · Sun Dec 17 23:00:00 EST 2023 · OSTI ID:2440208

Topological Simplifications of Hypergraphs
Journal Article · Thu Feb 24 19:00:00 EST 2022 · IEEE Transactions on Visualization and Computer Graphics · OSTI ID:2369460