Comparing the principal eigenvector of a hypergraph and its shadows

DOI10.1016/J.LAA.2023.05.006MaRDI QIDQ6161128zbMATH OpenOpenAlexFDO

Authors Gregory J. Clark, Felipe Thomaz, Andrew T. Stephen

Publication date 26 June 2023

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.laa.2023.05.006

zbMATH Keywords

clique expansioncorrelation coefficienteigenvectorgraph reductionhypergraphshadow

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Eigenvalues, singular values, and eigenvectors (15A18) Data structures (68P05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Three hypergraph eigenvector centralities
• Spectra of uniform hypergraphs
• On the principal eigenvectors of uniform hypergraphs
• Principal eigenvectors and spectral radii of uniform hypergraphs
• On the spectral radii and principal eigenvectors of uniform hypergraphs

Cites work

• A bound on the spectral radius of hypergraphs with \(e\) edges
• A Harary-Sachs theorem for hypergraphs
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite
• A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
• Analytic methods for uniform hypergraphs
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Connected hypergraphs with small spectral radius
• Consensus Dynamics and Opinion Formation on Hypergraphs
• Core-Periphery Detection in Hypergraphs
• Cutsets and partitions of hypergraphs
• Eigenvalues of a real supersymmetric tensor
• Finding the largest eigenvalue of a nonnegative tensor
• scientific article; zbMATH DE number 7273682 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Hypergraph Cuts with General Splitting Functions
• Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
• Multiplicities of tensor eigenvalues
• On spectral hypergraph theory of the adjacency tensor
• On the first and second eigenvalue of finite and infinite uniform hypergraphs
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Spectra of general hypergraphs
• Spectra of uniform hypergraphs
• Spectral extremal problems for hypergraphs
• Spectral properties of hypergraph Laplacian and approximation algorithms
• Tensor analysis. Spectral theory and special tensors
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• The spectra of uniform hypertrees
• When local and global clustering of networks diverge

Cited in

(4)

• Principal eigenvectors of general hypergraphs
• Three hypergraph eigenvector centralities
• Bounds on the \(\mathcal{A}_\alpha \)-spectral radius of uniform hypergraphs with some vertices deleted
• Spectral bipartite Turán problems on linear hypergraphs

This page was built for publication: Comparing the principal eigenvector of a hypergraph and its shadows

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