Related papers: On spectra of representations and graphs. Erratum

This is an addendum to a previous article, which aims to provide the proofs of some results in that paper (Theorem 7.5 and Proposition 9.15) which were removed from its final version. The reason for such omission is that these proofs follow…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

We study the spectral aspects of the graph limit theory. We give a description of graphon convergence in terms of converegnce of eigenvalues and eigenspaces. Along these lines we prove a spectral version of the strong regularity lemma.…

The Spectral Excess Theorem (SPET) for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. Recently, some local or global approaches to the SPET…

We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic…

Let $\mathcal{H}$ be a right quaternionic Hilbert space and let $T$ be a quaternionic normal operator with the domain $\mathcal{D}(T) \subset \mathcal{H}$. Then for a fixed unit imaginary quaternion $m$, there exists a Hilbert basis…

When using graphs and graph transformations to model systems, consistency is an important concern. While consistency has primarily been viewed as a binary property, i.e., a graph is consistent or inconsistent with respect to a set of…

It was pointed out to us that the proof of a crucial lemma (Lemma 5.3) in the paper is incorrect. Thus the approximation theorem (Theorem 0.1) for L^2 torsion of an amenable covering of a finite simplicial complex remains unproved. However,…

We obtain a representation formula for the derivative of the spectral shift function $\xi(\lambda; B, \epsilon)$ related to the operators $H_0(B,\epsilon) = (D_x - By)^2 + D_y^2 + \epsilon x$ and $H(B, \epsilon) = H_0(B, \epsilon) + V(x,y),…

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

An $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that $a\leq d_{H}(v)\leq b$ for each $v\in V(G)$. In this paper, we provide spectral conditions for the existence of an odd $[1,b]$-factor in a connected graph with minimum…

Recently, it has been shown that a connected graph $\Gamma$ with $d+1$ distinct eigenvalues and odd-girth $2d+1$ is distance-regular. The proof of this result was based on the spectral excess theorem. In this note we present an alternative…

Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…

Let $\sigma(A)$, $\rho(A)$ and $r(A)$ denote the spectrum, spectral radius and numerical radius of a bounded linear operator $A$ on a Hilbert space $H$, respectively. We show that a linear operator $A$ satisfying $$\rho(AB)\le r(A)r(B)…

The scope of this text is to study a process that induces another proof of the Spectral Embedding Theorem: that any densely defined symmetric operator can be extended by a multiplication operator through an embedding of the Hilbert space…

Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…

We consider a variable order differential operator on a graph with a cycle. We study the inverse spectral problem for this operator by the system of spectra. The main results of the paper are the uniqueness theorem and the constructive…

We consider an inverse problem for Schr\"odinger operators on a connected equilateral graph $G$ with standard matching conditions. The graph $G$ consists of at least two odd cycles glued together at a common vertex. We prove an Ambarzumian…

We use nonstandard methods to prove the direct integral version of the Spectral Theorem for Unbounded Self-adjoint Operators. Our proof avoids the standard reduction to the case of bounded normal operators via the Cayley transform and, as…

The $W$-random graphs provide a flexible framework for modeling large random networks. Using the Large Deviation Principle (LDP) for $W$-random graphs from [9], we prove the LDP for the corresponding class of random symmetric…