Scalable tensor methods for nonuniform hypergraphs

DOI10.1137/23M1584472MaRDI QIDQ6583520zbMATH OpenFDO

Authors Sinan Aksoy, Ilya Amburg, Stephen J. Young

Publication date 6 August 2024

Published in SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/23M1584472

zbMATH Keywords

adjacency tensorcentralityclusteringhypergraphtensor times same vectortensor-free methods

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Multilinear algebra, tensor calculus (15A69)

Recommendations

• Hypergraph analysis based on a compatible tensor product structure
• On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor
• Three hypergraph eigenvector centralities
• On Hb-graphs and their application to general hypergraph e-adjacency tensor
• Spectral theory of weighted hypergraphs via tensors

Cites work

• Adjacency energy of hypergraphs
• Algorithm AS 136: A K-Means Clustering Algorithm
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Community Detection in General Hypergraph Via Graph Embedding
• Computing tensor Z-eigenvectors with dynamical systems
• Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
• Finding the largest eigenvalue of a nonnegative tensor
• Gram mates, sign changes in singular values, and isomorphism
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Hypergraphx: a library for higher-order network analysis
• Numerical optimization for symmetric tensor decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
• Shifted power method for computing tensor eigenpairs
• SimpleHypergraphs.jl -- novel software framework for modelling and analysis of hypergraphs
• Spectra of general hypergraphs
• Spectra of regular graphs and hypergraphs and orthogonal polynomials
• Spectra, Euclidean representations and clusterings of hypergraphs
• Tensor analysis. Spectral theory and special tensors
• Tensor Decompositions and Applications
• The expression of a tensor or a polyadic as a sum of products.
• The signless Laplacian matrix of hypergraphs
• The Spacey Random Walk: A Stochastic Process for Higher-Order Data
• Three hypergraph eigenvector centralities
• Two-mode networks exhibiting data loss
• Visualizing data using t-SNE

Cited in

(2)

• Multi-linear pseudo-PageRank for hypergraph partitioning
• Hypergraph analysis based on a compatible tensor product structure

This page was built for publication: Scalable tensor methods for nonuniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6583520)