Pith. sign in

REVIEW 1 cited by

Kronecker Product of Tensors and Hypergraphs: Structure and Dynamics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.03875 v4 pith:3ISWHYVX submitted 2023-05-05 math.DS math.SP

classification math.DSmath.SP
keywords kroneckerproducttensorhypergraphssystemsdecompositionsdynamicsgraph
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Hypergraphs and tensors extend classic graph and matrix theory to account for multiway relationships, which are ubiquitous in engineering, biological, and social systems. While the Kronecker product is a potent tool for analyzing the coupling of systems in graph or matrix contexts, its effectiveness in capturing multiway interactions remains elusive. In this article, we present a comprehensive exploration of algebraic, structural, and spectral properties of the tensor Kronecker product. We express Tucker and tensor train decompositions and various tensor eigenvalues in terms of the tensor Kronecker product. Additionally, we utilize the tensor Kronecker product to form Kronecker hypergraphs, a tensor-based hypergraph product, and investigate the structure and stability of polynomial dynamics on Kronecker hypergraphs. Finally, we provide numerical examples to demonstrate the utility of the tensor Kronecker product in computing Z-eigenvectors, various tensor decompositions, and determining the stability of polynomial systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Fast randomized Kronecker tensor decomposition: algorithms and error analysis

    math.NA 2024-12 reject novelty 4.0 of 10

    Randomized SVD is substituted for deterministic SVD inside the TTr1SVD algorithm to obtain a faster Kronecker tensor decomposition, with an unproven recursive error bound.

Pith tools