Related papers: Constructing all self-adjoint matrices with prescr…
In this note, we give a self-contained and elementary proof of the elementary construction of spectral high-dimensional expanders using elementary matrices due to Kaufman and Oppenheim [Proc. 50th ACM Symp. on Theory of Computing (STOC),…
Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…
The largest eigenvalue of a network's adjacency matrix and its associated principal eigenvector are key elements for determining the topological structure and the properties of dynamical processes mediated by it. We present a physically…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let $G$ be a graph on $n$ vertices. A 2-lift of $G$ is a graph $H$ on $2n$ vertices,…
We prove almost sure convergence of the maximum degree in an evolving graph model combining a growing number of local choices with sublinear preferential attachment. At each step in the growth of the graph, a new vertex is introduced. Then…
We develop the spectral and scattering theory for self-adjoint Hankel operators $H$ with piecewise continuous symbols. In this case every jump of the symbol gives rise to a band of the absolutely continuous spectrum of $H$. We construct…
We propose algorithms for construction and random generation of hypergraphs without loops and with prescribed degree and dimension sequences. The objective is to provide a starting point for as well as an alternative to Markov chain Monte…
Two classical theorems in matrix theory, due to Schur and Horn, relate the eigenvalues of a self-adjoint matrix to the diagonal entries. These have recently been given a formulation in the setting of operator algebras as the Schur-Horn…
We draw attention to the fact that a Hermitian matrix is always diagonalizable and has real discrete spectrum whereas the Hermitian Schr{\"o}dinger Hamiltonian: $H=p^2/2\mu+V(x)$, may not be so. For instance when $V(x)=x, x^3, -x^2$, $H$…
The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than the Cartesian product. Here we study the eigenvalue spectrum…
The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…
Prime path coverage is a powerful structural testing criterion, but generating all prime paths in a directed graph remains computationally challenging due to the potentially exponential number of them. Existing approaches typically rely on…
The class of strictly sign regular (SSR) matrices has been extensively studied by many authors over the past century, notably by Schoenberg, Motzkin, Gantmacher, and Krein. A classical result of Gantmacher-Krein assures the existence of SSR…
In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove…
Given a graph $G$ on $n$ vertices, its adjacency matrix and degree diagonal matrix are represented by $A(G)$ and $D(G)$, respectively. The $Q$-spectrum of $G$ consists of all the eigenvalues of its signless Laplacian matrix $Q(G)=A(G)+D(G)$…
We find the spectrum and eigenvectors of an arbitrary irreducible complex tridiagonal matrix with two-periodic main diagonal provided that the spectrum and eigenvectors of the matrix with the same sub- and superdiagonals and zero main…
In this work the spectral theory of self-adjoint operator $A$ represented by Jacobi matrix is considered. The approach is based on the continued fraction representation of the resolvent matrix element of $A$. Different criteria of absolute…
We study a class of spectral design problems in which a prior positive semidefinite information matrix is updated by a sum of rank-one matrices constructed from chosen design vectors subject to a bound on their Euclidean norm. The objective…