2,782 research outputs found
Median eigenvalues of bipartite graphs
For a graph of order and with eigenvalues
, the HL-index is defined as
We show that for every connected
bipartite graph with maximum degree ,
unless is the the incidence graph of a
projective plane of order . We also present an approach through graph
covering to construct infinite families of bipartite graphs with large
HL-index
Hypergraphs and hypermatrices with symmetric spectrum
It is well known that a graph is bipartite if and only if the spectrum of its
adjacency matrix is symmetric. In the present paper, this assertion is
dissected into three separate matrix results of wider scope, which are extended
also to hypermatrices. To this end the concept of bipartiteness is generalized
by a new monotone property of cubical hypermatrices, called odd-colorable
matrices. It is shown that a nonnegative symmetric -matrix has a
symmetric spectrum if and only if is even and is odd-colorable. This
result also solves a problem of Pearson and Zhang about hypergraphs with
symmetric spectrum and disproves a conjecture of Zhou, Sun, Wang, and Bu.
Separately, similar results are obtained for the -spectram of
hypermatrices.Comment: 17 pages. Corrected proof on p. 1
Spectral graph theory : from practice to theory
Graph theory is the area of mathematics that studies networks, or graphs. It arose from the need to analyse many diverse network-like structures like road networks, molecules, the Internet, social networks and electrical networks. In spectral graph theory, which is a branch of graph theory, matrices are constructed from such graphs and analysed from the point of view of their so-called eigenvalues and eigenvectors. The first practical need for studying graph eigenvalues was in quantum chemistry in the thirties, forties and fifties, specifically to describe the Hückel molecular orbital theory for unsaturated conjugated hydrocarbons. This study led to the field which nowadays is called chemical graph theory. A few years later, during the late fifties and sixties, graph eigenvalues also proved to be important in physics, particularly in the solution of the membrane vibration problem via the discrete approximation of the membrane as a graph. This paper delves into the journey of how the practical needs of quantum chemistry and vibrating membranes compelled the creation of the more abstract spectral graph theory. Important, yet basic, mathematical results stemming from spectral graph theory shall be mentioned in this paper. Later, areas of study that make full use of these mathematical results, thus benefitting greatly from spectral graph theory, shall be described. These fields of study include the P versus NP problem in the field of computational complexity, Internet search, network centrality measures and control theory.peer-reviewe
Exact eigenspectrum of the symmetric simple exclusion process on the complete, complete bipartite, and related graphs
We show that the infinitesimal generator of the symmetric simple exclusion
process, recast as a quantum spin-1/2 ferromagnetic Heisenberg model, can be
solved by elementary techniques on the complete, complete bipartite, and
related multipartite graphs. Some of the resulting infinitesimal generators are
formally identical to homogeneous as well as mixed higher spins models. The
degeneracies of the eigenspectra are described in detail, and the
Clebsch-Gordan machinery needed to deal with arbitrary spin-s representations
of the SU(2) is briefly developed. We mention in passing how our results fit
within the related questions of a ferromagnetic ordering of energy levels and a
conjecture according to which the spectral gaps of the random walk and the
interchange process on finite simple graphs must be equal.Comment: Final version as published, 19 pages, 4 figures, 40 references given
in full forma
Entangled graphs: Bipartite entanglement in multi-qubit systems
Quantum entanglement in multipartite systems cannot be shared freely. In
order to illuminate basic rules of entanglement sharing between qubits we
introduce a concept of an entangled structure (graph) such that each qubit of a
multipartite system is associated with a point (vertex) while a bi-partite
entanglement between two specific qubits is represented by a connection (edge)
between these points. We prove that any such entangled structure can be
associated with a pure state of a multi-qubit system. Moreover, we show that a
pure state corresponding to a given entangled structure is a superposition of
vectors from a subspace of the -dimensional Hilbert space, whose dimension
grows linearly with the number of entangled pairs.Comment: 6 revtex pages, 2 figures, to appear in Phys. Rev.
Frames, Graphs and Erasures
Two-uniform frames and their use for the coding of vectors are the main
subject of this paper. These frames are known to be optimal for handling up to
two erasures, in the sense that they minimize the largest possible error when
up to two frame coefficients are set to zero. Here, we consider various
numerical measures for the reconstruction error associated with a frame when an
arbitrary number of the frame coefficients of a vector are lost. We derive
general error bounds for two-uniform frames when more than two erasures occur
and apply these to concrete examples. We show that among the 227 known
equivalence classes of two-uniform (36,15)-frames arising from Hadamard
matrices, there are 5 that give smallest error bounds for up to 8 erasures.Comment: 28 pages LaTeX, with AMS macros; v.3: fixed Thm 3.6, added comment,
Lemma 3.7 and Proposition 3.8, to appear in Lin. Alg. App
- …