On the symmetric doubly stochastic matrices that are determined by their spectra and their connection with spectral graph theory

DOI10.1080/03081087.2014.903590zbMATH Open1312.15048arXiv1310.1273OpenAlexW1974918548MaRDI QIDQ5175366FDOQ5175366

Authors: Bassam Mourad, Hassan Abbas 

Publication date: 20 February 2015

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Abstract: A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^{T}AP$ for some permutation matrix P. The problem of characterizing such matrices is considered here. An almost the same but a more difficult problem was proposed by [ M. Fang, A note on the inverse eigenvalue problem for symmetric doubly stochastic matrices, Lin. Alg. Appl., 432 (2010) 2925-2927] as follows: Characterize all n-tuples $lambda=(1,lambd{a}_2,\mathrm{...},lambd{a}_n)$ such that up to a permutation similarity, there exists a unique symmetric doubly stochastic matrix with spectrum $lambda.$ In this short note, some general results concerning our two problems are first obtained. Then, we completely solve these two problems for the case n = 3. Some connections with spectral graph theory are then studied. Finally, concerning the general case, two open questions are posed and a conjecture is introduced.

Full work available at URL: https://arxiv.org/abs/1310.1273

Recommendations

• The inverse eigenvalue problem for symmetric doubly stochastic matrices.
• An inverse problem for symmetric doubly stochastic matrices
• Doubly stochastic matrices with prescribed positive spectrum
• Inverse problems for symmetric doubly stochastic matrices whose Suleĭmanova spectra are bounded below by 1/2
• Some results on the symmetric doubly stochastic inverse eigenvalue problem

zbMATH Keywords

spectral graph theorydoubly stochastic matricesspectral characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Conditioning of matrices (15A12) Stochastic matrices (15B51)

Cites Work

• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• The inverse eigenvalue problem for symmetric doubly stochastic matrices.
• Row Stochastic Matrices Similar to Doubly Stochastic Matrices
• A note on the inverse eigenvalue problem for symmetric doubly stochastic matrices
• Graphs and matrices
• An inverse problem for symmetric doubly stochastic matrices
• On the extreme points of a certain convex polytope
• A note on the boundary of the set where the decreasingly ordered spectra of symmetric doubly stochastic matrices Lie
• An algorithm for constructing doubly stochastic matrices for the inverse eigenvalue problem
• On a spectral property of doubly stochastic matrices and its application to their inverse eigenvalue problem
• On a Lie-theoretic approach to generalized doubly stochastic matrices and applications
• Infinitely many pairs of cospectral integral regular graphs
• A note on symmetric doubly-stochastic matrices
• Generalization of some results concerning eigenvalues of a certain class of matrices and some applications

Cited In (1)

• A note on the boundary of the set where the decreasingly ordered spectra of symmetric doubly stochastic matrices Lie

This page was built for publication: On the symmetric doubly stochastic matrices that are determined by their spectra and their connection with spectral graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175366)