Related papers: The Spectral Edges Conjecture via Corners
The edge-connectivity of a graph is the minimum number of edges whose deletion disconnects the graph. Let $\Delta(G)$ the maximum degree of a graph $G$ and let $\rho(G)$ be the spectral radius of $G$. In this article we present a lower…
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…
Joint spectra of tuples of operators are subsets in complex projective space. The corresponding tuple of operators can be viewed as an infinite dimensional analog of a determinantal representation of the joint spectrum. We investigate the…
We re-examine a familiar problem given in introductory physics courses, about determining the induced charge distribution on an uncharged ``infinitely-large'' conducting plate when placing parallel to it a uniform charged dielectric plate…
We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…
In this paper, we give spectral conditions to guarantee the existence of two edge disjoint cycles and two cycles of the same length. These two results can be seen as spectral analogues of Erd\H{o}s and Posa's size condition and Erd\H{o}s'…
An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this…
In this paper we study subsets $E$ of ${\Bbb Z}_p^d$ such that any function $f: E \to {\Bbb C}$ can be written as a linear combination of characters orthogonal with respect to $E$. We shall refer to such sets as spectral. In this context,…
We develop a general theory for percolation in directed random networks with arbitrary two point correlations and bidirectional edges, that is, edges pointing in both directions simultaneously. These two ingredients alter the previously…
We study the asymptotic distribution of the eigenvalues of random Hermitian periodic band matrices, focusing on the spectral edges. The eigenvalues close to the edges converge in distribution to the Airy point process if (and only if) the…
We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…
Let a graph be observed through a finite random sampling mechanism. Spectral methods are routinely applied to such graphs, yet their outputs are treated as deterministic objects. This paper develops finite-sample inference for spectral…
A tree-strip of finite cone type is the product of a tree of finite cone type with a finite set. We consider random Schr\"odinger operators on these tree strips, similar to the Anderson model. We prove that for small disorder the spectrum…
A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…
We investigate spectral properties of limit-periodic Schr\"odinger operators in $\ell^2(\Z)$. Our goal is to exhibit as rich a spectral picture as possible. We regard limit-periodic potentials as generated by continuous sampling along the…
We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…
Let a finitely generated group $G$ split as a graph of groups. If edge groups are undistorted and do not contribute to the Morse boundary $\partial_MG$, we show that every connected component of $\partial_MG$ with at least two points…
In this paper, using the recently discovered notion of the $S$-spectrum, we prove the spectral theorem for a bounded or unbounded normal operator on a Clifford module (i.e., a two-sided Hilbert module over a Clifford algebra based on units…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.