On a Conjecture of Godsil Concerning Controllable Random Graphs
From MaRDI portal
Publication:2953321
DOI10.1137/15M1049622zbMath1352.93027arXiv1511.05080OpenAlexW2963968673WikidataQ122868685 ScholiaQ122868685MaRDI QIDQ2953321
Publication date: 4 January 2017
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05080
Applications of graph theory (05C90) Controllability (93B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
On Stable Systems with Random Structure ⋮ On the smallest singular value of symmetric random matrices ⋮ Unlocking the walk matrix of a graph ⋮ Partial strong structural controllability ⋮ A simple arithmetic criterion for graphs being determined by their generalized spectra ⋮ A new criterion for almost controllable graphs being determined by their generalized spectra ⋮ Unnamed Item ⋮ On a theorem of Godsil and McKay concerning the construction of cospectral graphs ⋮ The polynomial reconstruction problem: the first 50 years ⋮ Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) ⋮ New families of graphs determined by their generalized spectrum ⋮ On the generalized spectral characterizations of Eulerian graphs ⋮ The overgraphs of generalized cospectral controllable graphs ⋮ Note on graphs with irreducible characteristic polynomials ⋮ Low-degree factors of random polynomials ⋮ Eigenvectors of random matrices of symmetric entry distributions ⋮ Pairing between zeros and critical points of random polynomials with independent roots ⋮ A note on non-\(\mathbb{R}\)-cospectral graphs ⋮ How to suppress dark states in quantum networks and bio-engineered structures ⋮ Graphs with \(n - 1\) main eigenvalues ⋮ Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random matrices: tail bounds for gaps between eigenvalues
- No-gaps delocalization for general random matrices
- On the distribution of the roots of certain symmetric matrices
- Random matrices have simple spectrum
- Controllable subsets in graphs
- Laplacian controllability classes for threshold graphs
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Controllability, Identification, and Randomness in Distributed Systems
- Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
- Smallest singular value of a random rectangular matrix
- Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation
- Gramian-Based Reachability Metrics for Bilinear Networks
- Some estimates of norms of random matrices
- Probability: A Graduate Course
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- On the Controllability Properties of Circulant Networks
- Controllability Metrics, Limitations and Algorithms for Complex Networks
- Minimal Controllability Problems
- Invertibility of symmetric random matrices
- Small Ball Probability, Inverse Theorems, and Applications
