Graphs, simplicial complexes and hypergraphs: Spectral theory and topology
In this chapter we discuss the spectral theory of discrete structures such as graphs, simplicial
complexes and hypergraphs. We focus, in particular, on the corresponding Laplace …
complexes and hypergraphs. We focus, in particular, on the corresponding Laplace …
Topological characterization and typical topologies of disruption aggregates in asphalt mixture
C **ng, B Liu, H Liu, L Zhang, H Xu… - Journal of Materials in …, 2024 - ascelibrary.org
Mesoscale contact networks for asphalt mixtures play a crucial role in load resistance.
However, there is a lack of quantitative characterization methods for contact networks …
However, there is a lack of quantitative characterization methods for contact networks …
Spectral theory of Laplace operators on oriented hypergraphs
Several new spectral properties of the normalized Laplacian defined for oriented
hypergraphs are shown. The eigenvalue 1 and the case of duplicate vertices are discussed; …
hypergraphs are shown. The eigenvalue 1 and the case of duplicate vertices are discussed; …
Sharp bounds for the largest eigenvalue
R Mulas - Mathematical notes, 2021 - Springer
Sharp Bounds for the Largest Eigenvalue | Mathematical Notes Skip to main content
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
Spectral properties of oriented hypergraphs
N Reff - arxiv preprint arxiv:1506.05054, 2015 - arxiv.org
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label
of $+ 1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are …
of $+ 1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are …
Oriented Hypergraphs I: Introduction and Balance
LJ Rusnak - arxiv preprint arxiv:1210.0943, 2012 - arxiv.org
An oriented hypergraph is an oriented incidence structure that extends the concept of a
signed graph. We introduce hypergraphic structures and techniques central to the extension …
signed graph. We introduce hypergraphic structures and techniques central to the extension …
[HTML][HTML] A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
G Chen, V Liu, E Robinson, LJ Rusnak… - Linear Algebra and its …, 2018 - Elsevier
An oriented hypergraph is an oriented incidence structure that generalizes and unifies graph
and hypergraph theoretic results by examining its locally signed graphic substructure. In this …
and hypergraph theoretic results by examining its locally signed graphic substructure. In this …
[PDF][PDF] Lower bounds for the Laplacian spectral radius of an oriented hypergraph.
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label
of+ 1 or− 1. This labeling allows one to naturally define adjacencies so the Laplacian matrix …
of+ 1 or− 1. This labeling allows one to naturally define adjacencies so the Laplacian matrix …
Spectral theory of weighted hypergraphs via tensors
One way to study a hypergraph is to attach to it a tensor. Tensors are a generalization of
matrices, and they are an efficient way to encode information in a compact form. In this …
matrices, and they are an efficient way to encode information in a compact form. In this …
[HTML][HTML] Spectra of cycle and path families of oriented hypergraphs
L Duttweiler, N Reff - Linear Algebra and its Applications, 2019 - Elsevier
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label
of either+ 1 or− 1. This generalizes signed graphs to a hypergraph setting and …
of either+ 1 or− 1. This generalizes signed graphs to a hypergraph setting and …