PreprintCC BY 4.0arXiv
Fuzzy Erdos-Renyi random graphs: Spectral statistics
Abstract
Within a random-matrix-theory (RMT) approach, we perform a detailed numerical study of the spectral statistics of fuzzy Erdos-Renyi (ER) random graphs. Specifically, we consider the membership values of the vertices and edges of a fuzzy ER graph model as random variables. In this way, the corresponding adjacency matrices become sparse matrices with random entries. Then, we apply standard RMT measures to characterize the eigenvalues and eigenvectors of ensembles of Hermitian and non-Hermitian adjacency matrices of both undirected and directed fuzzy graphs. We demonstrate that the average degree of the ER model serves as the scaling parameter of the spectral properties of the corresponding fuzzy setups.
Related
- Exploring continuous beta-ensembles: A Python implementation for random matrix spectral statistics
- Onset of random-matrix statistics in the Yukawa-Sachdev-Ye-Kitaev model: Spectral correlations and Krylov complexity
- Spectral and Eigenvector Crossovers in Random Mixed Graphs
- Universal Eigenvector Statistics of Non-Hermitian Random Matrices
- Duality between the level statistics of Hermitian and non-Hermitian random matrices
BibTeX
@misc{mendezbermudez2026fuzzy,
title = {{Fuzzy Erdos-Renyi random graphs: Spectral statistics}},
author = {J. A. Mendez-Bermudez},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.13432},
eprint = {2609.13432},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.13432},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Fuzzy Erdos-Renyi random graphs: Spectral statistics
AU - J. A. Mendez-Bermudez
PY - 2026
DA - 2026/09/11
PB - arXiv
DO - 10.48550/arxiv.2609.13432
UR - https://arxiv.org/abs/2609.13432
AB - Within a random-matrix-theory (RMT) approach, we perform a detailed numerical study of the spectral statistics of fuzzy Erdos-Renyi (ER) random graphs. Specifically, we consider the membership values of the vertices and edges of a fuzzy ER graph model as random variables. In this way, the corresponding adjacency matrices become sparse matrices with random entries. Then, we apply standard RMT measures to characterize the eigenvalues and eigenvectors of ensembles of Hermitian and non-Hermitian adjacency matrices of both undirected and directed fuzzy graphs. We demonstrate that the average degree of the ER model serves as the scaling parameter of the spectral properties of the corresponding fuzzy setups.
ER -