Signless normalized Laplacian for hypergraphs

DOI10.5614/ejgta.2022.10.2.11zbMath1499.05351arXiv2005.14484OpenAlexW3119024388MaRDI QIDQ5054045

Eleonora Andreotti, Raffaella Mulas

Publication date: 29 November 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.14484

zbMATH Keywords

spectral theoryhypergraphssignless normalized Laplace operator

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SIS epidemic propagation on hypergraphs
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• An oriented hypergraphic approach to algebraic graph theory
• Obstructions to convexity in neural codes
• Every binary code can be realized by convex sets
• On the multiplicity of Laplacian eigenvalues and Fiedler partitions
• Hypergraph Laplace operators for chemical reaction networks
• Spectral theory of Laplace operators on oriented hypergraphs
• Sharp bounds for the largest eigenvalue
• Fluctuations in stochastic interacting particle systems
• Minimal embedding dimensions of connected neural codes
• What can topology tell us about the neural code?
• Some exact results for the exclusion process
• Hamilton Paths in Grid Graphs
• Determining the robustness of an interdependent network with a hypergraph model
• Rainbow perfect domination in lattice graphs
• Intersecting longest paths and longest cycles: A survey
• A No-Go Theorem for One-Layer Feedforward Networks
• What Makes a Neural Code Convex?