Spectral and Eigenvector Crossovers in Random Mixed Graphs

Abstract

We study the spectral and eigenvector properties of random mixed graphs, combining undirected and directed interactions, using random matrix theory (RMT). The network is represented by a Hermitian adjacency matrix, with undirected links as real entries and directed links as purely imaginary conjugate pairs, ensuring a real spectrum. Network density is controlled by the connection probability, while directionality sets the fraction of directed edges. We focus on the GOE-to-GUE crossover: at fixed connectivity, increasing directionality breaks time-reversal symmetry and drives spectral statistics from GOE to GUE. We show that this transition requires sufficient connectivity. In sparse networks, weak level repulsion produces Poisson statistics regardless of directionality. At fixed directionality, increasing connectivity drives a Poisson-to-GUE crossover; only above a sparsity threshold does the directionality-induced GOE-to-GUE transition emerge. In the dense regime, where the spectral density follows the Wigner semicircle law, the crossover is characterized using spacing distributions, spacing ratios, and spectral rigidity. In sparse networks, where unfolding is unreliable, spacing-ratio statistics provide an unfolding-free characterization. Eigenvector structure is examined through multifractal dimensions and component distributions, while Kullback--Leibler divergence confirms the robustness of the transitions. Applied to S&P 500 mixed graphs, the framework reveals a GOE-to-GUE crossover across four major market crashes. Denser crisis periods show sharper crossovers than sparser recovery periods. The results provide a unified picture of how connectivity and symmetry breaking govern spectral and eigenvector universality, while providing a transparent probe of changing financial-market organization.

Fuzzy Erdos-Renyi random graphs: Spectral statistics
J. A. Mendez-Bermudez
arXiv11 Sep 2026PreprintCC BY 4.0Full textCondensed matterarXiv
Universal Eigenvector Statistics of Non-Hermitian Random Matrices
Ze Chen, Zhenyu Xiao, Shinsei Ryu
arXiv18 Sep 2026PreprintCC BY 4.0Full textCondensed matter Quantum physics & quantum informationarXiv
Scalable quantum-enhanced greedy algorithm for the maximum independent set problems on random regular graphs
Elisabeth Wybo, Jami Rönkkö, Olli Hirviniemi +2
Physical Review Research19 Oct 2026Peer-reviewedPublisher termsAtomic, molecular & optical physicsCrossref
Random Cellular Automata and deBruijn Graphs
Janko Gravner, Travis Kulhanek
arXiv22 Oct 2026PreprintarXiv licenceFull textProbability Statistical & nonlinear physicsarXiv
Induced random mixed states are symmetric Dirichlet mixtures
Brian T. Kirby, Alexander C. B. Greenwood, Sanjaya Lohani +1
arXiv8 Sep 2026PreprintarXiv licenceFull textQuantum physics & quantum informationarXiv

Cite

BibTeX RIS

BibTeX

@misc{shekhar2026spectral,
  title = {{Spectral and Eigenvector Crossovers in Random Mixed Graphs}},
  author = {Himanshu Shekhar and Hrishidev Unni and Santosh Kumar and Anirban Chakraborti},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.04152},
  eprint = {2609.04152},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.04152},
}

RIS

TY  - UNPB
TI  - Spectral and Eigenvector Crossovers in Random Mixed Graphs
AU  - Himanshu Shekhar
AU  - Hrishidev Unni
AU  - Santosh Kumar
AU  - Anirban Chakraborti
PY  - 2026
DA  - 2026/09/03
PB  - arXiv
DO  - 10.48550/arxiv.2609.04152
UR  - https://arxiv.org/abs/2609.04152
AB  - We study the spectral and eigenvector properties of random mixed graphs, combining undirected and directed interactions, using random matrix theory (RMT). The network is represented by a Hermitian adjacency matrix, with undirected links as real entries and directed links as purely imaginary conjugate pairs, ensuring a real spectrum. Network density is controlled by the connection probability, while directionality sets the fraction of directed edges. We focus on the GOE-to-GUE crossover: at fixed connectivity, increasing directionality breaks time-reversal symmetry and drives spectral statistics from GOE to GUE. We show that this transition requires sufficient connectivity. In sparse networks, weak level repulsion produces Poisson statistics regardless of directionality. At fixed directionality, increasing connectivity drives a Poisson-to-GUE crossover; only above a sparsity threshold does the directionality-induced GOE-to-GUE transition emerge. In the dense regime, where the spectral density follows the Wigner semicircle law, the crossover is characterized using spacing distributions, spacing ratios, and spectral rigidity. In sparse networks, where unfolding is unreliable, spacing-ratio statistics provide an unfolding-free characterization. Eigenvector structure is examined through multifractal dimensions and component distributions, while Kullback--Leibler divergence confirms the robustness of the transitions. Applied to S&P 500 mixed graphs, the framework reveals a GOE-to-GUE crossover across four major market crashes. Denser crisis periods show sharper crossovers than sparser recovery periods. The results provide a unified picture of how connectivity and symmetry breaking govern spectral and eigenvector universality, while providing a transparent probe of changing financial-market organization.
ER  -

Abstract

Related

Cite