Related papers: Spectrum for first-order properties of random hype…
First-order logic is known to have limited expressive power over finite structures. It enjoys in particular the locality property, which states that first-order formulae cannot have a global view of a structure. This limitation ensures on…
Spectral properties of bounded linear operators play a crucial role in several areas of mathematics and physics. For each self-adjoint, trace-class operator $O$ we define a set $\Lambda_n\subset \mathbb{R}$, and we show that it converges to…
Antonio Ros gave a lower bound for the first eigenvalue $\lambda_1$ of $\Delta$ of a $P$-manifold $(M, g)$ in terms of the lower bound on the Ricci curvature $Ric_M$ and asked what happened when this lower bound was achieved. In this paper…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
Random graph models are used to describe the complex structure of real-world networks in diverse fields of knowledge. Studying their behavior and fitting properties are still critical challenges, that in general, require model specific…
We study the spectrum of unbounded J-self-adjoint block operator matrices. In particular, we prove enclosures for the spectrum, provide a sufficient condition for the spectrum being real and derive variational principles for certain real…
Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…
For a given graph G and an associated class of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in G, the collection of all possible spectra for such matrices is considered. Building on the pioneering work…
If an $n$-uniform hypergraph can be 2-colored, then it is said to have property B. Erd\H{o}s (1963) was the first to give lower and upper bounds for the minimal size $m(n)$ of an $n$-uniform hypergraph without property B. His asymptotic…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
The study of complex networks has been one of the most active fields in science in recent decades. Spectral properties of networks (or graphs that represent them) are of fundamental importance. Researchers have been investigating these…
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. Its correct interpretation as a measure of uniformity of the degree sequence requires the determination of its extremal…
This is a survey about spectral sets, to appear in the second edition of Handbook of Linear Algebra (L. Hogben, ed.). Spectral sets and K-spectral sets, introduced by John von Neumann, offer a possibility to estimate the norm of functions…
Hypergraphs require higher-dimensional representations, which makes it more difficult to compute and interpret their spectral properties. This survey article uses the framework of hypermatrices to give an in-depth overview of the spectral…
We introduce the notion of \emph{joint spectrum} of a compact set of matrices $S \subset GL_d(\mathbb{C})$, which is a multi-dimensional generalization of the joint spectral radius. We begin with a thorough study of its properties (under…
We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…
The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms…
We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nesetril and Ossona de Mendez. This generalizes several results from the literature,…
The supersymmetric particle spectrum is calculated in type I string theories formulated as orientifold compactifications of type IIB string theory. A string scale at an intermediate value of $10^{11}-10^{12}$ GeV is assumed and extra…
We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…