The Laplacian of a uniform hypergraph

From MaRDI portal
Publication:2253955

DOI10.1007/s10878-013-9596-xzbMath1309.05120OpenAlexW2162602945MaRDI QIDQ2253955

Liqun Qi, Sheng-Long Hu

Publication date: 16 February 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9596-x




Related Items (35)

Circulant tensors with applications to spectral hypergraph theory and stochastic processNetworks beyond pairwise interactions: structure and dynamicsHypergraph Laplacians in Diffusion FrameworkContinuation methods for computing Z-/H-eigenpairs of nonnegative tensorsExact and inexact iterative methods for finding the largest eigenpair of a weakly irreducible nonnegative tensorThe extremal spectral radii of \(k\)-uniform supertreesA Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order TensorSome properties of the Laplace and normalized Laplace spectra of uniform hypergraphsNewton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensorA survey on the spectral theory of nonnegative tensorsComputing all Laplacian H-eigenvalues for a uniform loose path of length threeThe Laplacian tensor of a multi-hypergraphThe spectral radii of intersecting uniform hypergraphsThe Fiedler Vector of a Laplacian Tensor for Hypergraph PartitioningGeneralizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithmThe high order spectrum of a graph and its applications in graph colouring and clique countingA family of gradient methods using Householder transformation with application to hypergraph partitioningSymmetry of eigenvalues of Sylvester matrices and tensorsNoda iteration for computing generalized tensor eigenpairsOn spectral theory of a k-uniform directed hypergraphOn extremal spectral radius of blow-up uniform hypergraphsSome spectral properties of uniform hypergraphsFinding all H-Eigenvalues of Signless Laplacian Tensor for a Uniform Loose Path of Length ThreeSpectra of general hypergraphsOn Laplacian spectra of parametric families of closely connected networks with application to cooperative controlOn the first and second eigenvalue of finite and infinite uniform hypergraphsComputing the \(p\)-spectral radii of uniform hypergraphs with applicationsSome properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphsThe matching polynomials and spectral radii of uniform supertreesLargest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose pathsThe adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphsCharacterizations of the spectral radius of nonnegative weakly irreducible tensors via a digraphSpectral directed hypergraph theory via tensorsSimplifying the computation of the spectrum of the complete \(k\)-uniform hypergraphAn SDP relaxation method for Perron pairs of a nonnegative tensor



Cites Work


This page was built for publication: The Laplacian of a uniform hypergraph