Search

In this article, we investigate connected signed graphs which have a connected star complement for both − 2 -2 and 2 (i.e. simultaneously for the two eigenvalues), where − 2 -2 (resp. 2) is the least (largest) eigenvalue of the adjacency matrix of a signed graph under consideration. We determine all such star complements and their maximal extensions (again, relative to both eigenvalues). As an application, we provide a new proof of the result which identifies all signed graphs that have no eigenvalues other than − 2 -2 and 2.

We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $\frac{n-1}2$. With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $\frac{n-1}{2}$., 8 pages, 1 figure

The mathematician Georg Cantor, the writer Jorge Luis Borges, and the protagonist of Borges' short story The Aleph, Carlos Argentino Daneri, are seen here as three pieces of a single puzzle. We put these pieces together and we look at the surprising figure that we obtain.

The $p$-Laplacian for graphs, as well as the vertex Laplace operator and the hyperedge Laplace operator for the general setting of oriented hypergraphs, are generalized. In particular, both a vertex $p$-Laplacian and a hyperedge $p$-Laplacian are defined for oriented hypergraphs, for all $p\geq 1$. Several spectral properties of these operators are investigated., Vietnam Journal of Mathematics, To appear (2022)

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 paper, we study how properties of weighted hypergraphs are reflected on eigenvalues and eigenvectors of their associated tensors. We also show how to efficiently compute eigenvalues with some techniques from numerical algebraic geometry.

The independence number, coloring number and related parameters are investigated in the setting of oriented hypergraphs using the spectrum of the normalized Laplace operator. For the independence number, both an inertia--like bound and a ratio--like bound are shown. A Sandwich Theorem involving the clique number, the vector chromatic number and the coloring number is proved, as well as a lower bound for the vector chromatic number in terms of the smallest and the largest eigenvalue of the normalized Laplacian. In addition, spectral partition numbers are studied in relation to the coloring number., Comment: Linear Algebra and Its Applications, To appear

Networks of genetic expression can be modeled by hypergraphs with the additional structure that real coefficients are given to each vertex-edge incidence. The spectra, i.e. the multiset of the eigenvalues, of such hypergraphs, are known to encode structural information of the data. We show how these spectra can be used, in particular, in order to give an estimation of cellular redundancy, a novel measure of gene expression heterogeneity, of the network. We analyze some simulated and real data sets of gene expression for illustrating the new method proposed here.

In the study of dynamical systems on networks or graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that, instead of microscopic details of the individual nodes or vertices, rather make the influence of the network coupling topology visible. The master stability function is an important such tool to achieve this goal. Here, we generalize the master stability approach to hypergraphs. A hypergraph coupling structure is important as it allows us to take into account arbitrary higher-order interactions between nodes. As, for instance, in the theory of coupled map lattices, we study Laplace-type interaction structures in detail. Since the spectral theory of Laplacians on hypergraphs is richer than on graphs, we see the possibility of different dynamical phenomena. More generally, our arguments provide a blueprint for how to generalize dynamical structures and results from graphs to 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; two Courant nodal domain theorems are established; new quantities that bound the eigenvalues are introduced. In particular, the Cheeger constant is generalized and it is shown that the classical Cheeger bounds can be generalized for some classes of hypergraphs; it is shown that a geometric quantity used to study zonotopes bounds the largest eigenvalue from below, and that the notion of coloring number can be generalized and used for proving a Hoffman-like bound. Finally, the spectrum of the unnormalized Laplacian for Cartesian products of hypergraphs is discussed., Comment: 39 pages

We generalize the classical sharp bounds for the largest eigenvalue of the normalized Laplace operator, $$N/(N-1)\leq \lambda_N\leq 2$$ , to the case of chemical hypergraphs.

We generalize the normalized combinatorial Laplace operator for graphs by defining two Laplace operators for hypergraphs that can be useful in the study of chemical reaction networks. We also investigate some properties of their spectra., Comment: 23 pages, 7 figures

In the past few years, the study of receptive field codes has been of large interest to mathematicians. Here we give a complete characterization of receptive field codes realizable by connected receptive fields and we give the minimal embedding dimensions of these codes. In particular, we show that all connected codes are realizable in dimension at most 3. To our knowledge, this is the first family of receptive field codes for which the exact characterization and minimal embedding dimension is known., 9 pages, 4 figures