On the public citation graph

Random matrices have simple spectrum

https://doi.org/10.1007/s00493-016-3363-4

0 signed · 78 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.20327openalex-snapshot

A sharp inverse Littlewood-Offord theorem

inferredcites →https://doi.org/10.1007/978-3-642-39286-3_16openalex-snapshot

Small Ball Probability, Inverse Theorems, and Applications

inferredcites →https://doi.org/10.1007/s00220-012-1527-7openalex-snapshot

Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues

inferredcites →https://doi.org/10.1016/j.aim.2011.01.005openalex-snapshot

Optimal inverse Littlewood–Offord theorems

inferredcites →https://doi.org/10.1017/cbo9780511755149openalex-snapshot

Additive Combinatorics

inferredcites →https://doi.org/10.1145/3564246openalex-snapshot

Proceedings of the 55th Annual ACM Symposium on Theory of Computing

inferredcites →https://doi.org/10.1145/800070.802206openalex-snapshot

Isomorphism of graphs with bounded eigenvalue multiplicity

inferredcites →https://doi.org/10.4007/annals.2009.169.595openalex-snapshot

Inverse Littlewood–Offord theorems and the condition number of random discrete matrices

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4626297openalex-extracted

inferred← citeshttps://doi.org/10.1002/rnc.5527openalex-snapshot

The robust minimal controllability and observability problem

inferred← citeshttps://doi.org/10.1007/978-3-030-81698-8_1openalex-snapshot

Bohemian Matrices: Past, Present and Future

inferred← citeshttps://doi.org/10.1007/s00373-019-02042-1openalex-snapshot

On the Eigenvalues Distribution in Threshold Graphs

inferred← citeshttps://doi.org/10.1007/s00440-016-0693-5openalex-snapshot

Random matrices: tail bounds for gaps between eigenvalues

inferred← citeshttps://doi.org/10.1007/s00493-020-4657-0openalex-snapshot

The Characteristic Polynomial of a Random Matrix

inferred← citeshttps://doi.org/10.1007/s10801-021-01065-3openalex-snapshot

Unlocking the walk matrix of a graph

inferred← citeshttps://doi.org/10.1007/s10884-021-10101-6openalex-snapshot

Bifurcations in Nagumo Equations on Graphs and Fiedler Vectors

inferred← citeshttps://doi.org/10.1007/s10959-018-0839-8openalex-snapshot

Low-Degree Factors of Random Polynomials

inferred← citeshttps://doi.org/10.1007/s11222-018-9814-6openalex-snapshot

Minimum spectral connectivity projection pursuit

inferred← citeshttps://doi.org/10.1016/j.aim.2019.02.013openalex-snapshot

Random matrices: Probability of normality

inferred← citeshttps://doi.org/10.1016/j.amc.2022.127233openalex-snapshot

On Hosoya’s dormants and sprouts

inferred← citeshttps://doi.org/10.1016/j.automatica.2017.04.053openalex-snapshot

The robust minimal controllability problem

inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112232openalex-snapshot

Generic diagonalizability, structural functional observability and output controllability

inferred← citeshttps://doi.org/10.1016/j.jcta.2016.06.008openalex-snapshot

Eigenvectors of random matrices: A survey

inferred← citeshttps://doi.org/10.1016/j.laa.2015.11.027openalex-snapshot

On the number of integral graphs

inferred← citeshttps://doi.org/10.1016/j.laa.2019.05.025openalex-snapshot

Determinants of Seidel matrices and a conjecture of Ghorbani

inferred← citeshttps://doi.org/10.1016/j.laa.2020.03.037openalex-snapshot

Upper Hessenberg and Toeplitz Bohemians

inferred← citeshttps://doi.org/10.1016/j.laa.2022.11.004openalex-snapshot

An ensemble of high rank matrices arising from tournaments

inferred← citeshttps://doi.org/10.1016/j.laa.2023.04.008openalex-snapshot

On the multiplicities of digraph eigenvalues

inferred← citeshttps://doi.org/10.1016/j.laa.2024.04.006openalex-snapshot

Low-rank matrices, tournaments, and symmetric designs

inferred← citeshttps://doi.org/10.1016/j.sigpro.2024.109732openalex-snapshot

Learning bipartite graphs from spectral templates

inferred← citeshttps://doi.org/10.1017/fmp.2023.29openalex-snapshot

The least singular value of a random symmetric matrix

inferred← citeshttps://doi.org/10.1038/s41598-018-35416-1openalex-snapshot

Global optimization of spin Hamiltonians with gain-dissipative systems

inferred← citeshttps://doi.org/10.1080/10618600.2022.2134874openalex-snapshot

Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks

inferred← citeshttps://doi.org/10.1090/proc/14284openalex-snapshot

Eigenvectors of random matrices of symmetric entry distributions

inferred← citeshttps://doi.org/10.1090/tran/8584openalex-snapshot

Random quantum graphs

inferred← citeshttps://doi.org/10.1103/physreva.102.022423openalex-snapshot

Analog quantum algorithms for the mixing of Markov chains

inferred← citeshttps://doi.org/10.1103/physrevlett.124.050501openalex-snapshot

How Fast Do Quantum Walks Mix?

inferred← citeshttps://doi.org/10.1109/cdc.2016.7799064openalex-snapshot

Littlewood-Offord theory and controllability of random structures

inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304187openalex-snapshot

Distributed Computation of Graph Matching in Multi-Agent Networks

inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10384211openalex-snapshot

Observability Blocking for Functional Privacy of Linear Dynamic Networks

inferred← citeshttps://doi.org/10.1109/ieeeconf59524.2023.10476991openalex-snapshot

DeepGRAND: Deep Graph Neural Diffusion

inferred← citeshttps://doi.org/10.1109/sampta64769.2025.11133556openalex-snapshot

Phase retrieval for solutions of the Schrödinger equations

inferred← citeshttps://doi.org/10.1109/tac.2023.3295698openalex-snapshot

Observability Robustness Under Sensor Failures: A Computational Perspective

inferred← citeshttps://doi.org/10.1109/tcns.2016.2553366openalex-snapshot

Optimality of Fast-Matching Algorithms for Random Networks With Applications to Structural Controllability

inferred← citeshttps://doi.org/10.1109/tcns.2018.2867415openalex-snapshot

Analysis and Design of Actuation–Sensing–Communication Interconnection Structures Toward Secured/Resilient LTI Closed-Loop Systems

inferred← citeshttps://doi.org/10.1109/tcyb.2022.3140338openalex-snapshot

Distributed Optimization for Graph Matching

inferred← citeshttps://doi.org/10.1109/tnse.2025.3618388openalex-snapshot

Observability Blocking for Functional Privacy of Dynamic Networks

inferred← citeshttps://doi.org/10.1109/tsipn.2022.3216099openalex-snapshot

How Likely is a Random Network Graph Shift-Enabled?

inferred← citeshttps://doi.org/10.1137/15m1049622openalex-snapshot

On a Conjecture of Godsil Concerning Controllable Random Graphs

inferred← citeshttps://doi.org/10.1142/s2010326325500170openalex-snapshot

Eigenvalue gaps of random perturbations of large matrices

inferred← citeshttps://doi.org/10.1145/3476446.3536177openalex-snapshot

Bohemian Matrix Geometry

inferred← citeshttps://doi.org/10.1214/16-aihp754openalex-snapshot

Spectra of nearly Hermitian random matrices

inferred← citeshttps://doi.org/10.1214/19-aihp1032openalex-snapshot

Sparse random matrices have simple spectrum

inferred← citeshttps://doi.org/10.1214/20-ps346openalex-snapshot

Recent progress in combinatorial random matrix theory

inferred← citeshttps://doi.org/10.1214/21-aop1522openalex-snapshot

On the real Davies’ conjecture

inferred← citeshttps://doi.org/10.1214/21-ejp588openalex-snapshot

Eigenvectors and controllability of non-Hermitian random matrices and directed graphs

inferred← citeshttps://doi.org/10.1214/21-ejp669openalex-snapshot

Tail bounds for gaps between eigenvalues of sparse random matrices

inferred← citeshttps://doi.org/10.14232/ejqtde.2018.1.52openalex-snapshot

Moving average network examples for asymptotically stable periodic orbits of monotone maps

inferred← citeshttps://doi.org/10.1515/spma-2024-0025openalex-snapshot

Selected open problems in continuous-time quantum walks

inferred← citeshttps://doi.org/10.1553/etna_vol55s76openalex-snapshot

Upper Hessenberg and Toeplitz Bohemian matrix sequences: a note on their asymptotical eigenvalues and singular values

inferred← citeshttps://doi.org/10.17863/cam.35399openalex-snapshot

Global optimization of spin Hamiltonians with gain-dissipative systems

inferred← citeshttps://doi.org/10.18452/17293openalex-snapshot

Synchrony and bifurcations in coupled dynamical systems and effects of time delay

inferred← citeshttps://doi.org/10.23919/acc.2018.8431919openalex-snapshot

The robust minimal controllability problem for switched linear continuous-time systems

inferred← citeshttps://doi.org/10.23919/ecc55457.2022.9837973openalex-snapshot

Further Analysis on Structure and Spectral Properties of Symmetric Graphs

inferred← citeshttps://doi.org/10.26493/1855-3974.1021.c0aopenalex-snapshot

On ±1 eigenvectors of graphs

inferred← citeshttps://doi.org/10.37236/7867openalex-snapshot

A New Perspective on the Average Mixing Matrix

inferred← citeshttps://doi.org/10.3934/fods.2024034openalex-snapshot

Graph Matching via convex relaxation to the simplex

inferred← citeshttps://doi.org/10.48550/arxiv.1510.00039openalex-snapshot

Spectra of nearly Hermitian random matrices

inferred← citeshttps://doi.org/10.48550/arxiv.1511.02963openalex-snapshot

Analysis and Design of Actuation-Sensing-Communication Interconnection Structures towards Secured/Resilient Closed-loop Systems

inferred← citeshttps://doi.org/10.48550/arxiv.1608.01938openalex-snapshot

Low-degree factors of random polynomials

inferred← citeshttps://doi.org/10.48550/arxiv.1709.03591openalex-snapshot

A New Perspective on the Average Mixing Matrix

inferred← citeshttps://doi.org/10.48550/arxiv.1709.06682openalex-snapshot

Random matrices: overcrowding estimates for the spectrum

inferred← citeshttps://doi.org/10.48550/arxiv.1809.10653openalex-snapshot

Bohemian Upper Hessenberg Matrices

inferred← citeshttps://doi.org/10.48550/arxiv.1809.10664openalex-snapshot

Bohemian Upper Hessenberg Toeplitz Matrices

inferred← citeshttps://doi.org/10.48550/arxiv.2007.13611openalex-snapshot

Non-backtracking Spectrum: Unitary Eigenvalues and Diagonalizability

inferred← citeshttps://doi.org/10.48550/arxiv.2008.10176openalex-snapshot

Division algebra valued energized simplicial complexes

inferred← citeshttps://doi.org/10.48550/arxiv.2012.04646openalex-snapshot

Spectral clustering via adaptive layer aggregation for multi-layer networks

inferred← citeshttps://doi.org/10.48550/arxiv.2109.00339openalex-snapshot

How likely is a random graph shift-enabled?

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.