Native ultrametricity of sparse random ensembles
From MaRDI portal
Publication:2994558
Abstract: We investigate the eigenvalue density in ensembles of large sparse Bernoulli random matrices. We demonstrate that the fraction of linear subgraphs just below the percolation threshold is about 95% of all finite subgraphs, and the distribution of linear chains is purely exponential. We analyze in detail the spectral density of ensembles of linear subgraphs, discuss its ultrametric nature and show that near the spectrum boundary, the tail of the spectral density exhibits a Lifshitz singularity typical for Anderson localization. We also discuss an intriguing connection of the spectral density to the Dedekind -function. We conjecture that ultrametricity is inherit to complex systems with extremal sparse statistics and argue that a number-theoretic ultrametricity emerges in any rare-event statistics.
Recommendations
- Sparse random matrices: the eigenvalue spectrum revisited
- Spectra of sparse random matrices
- Peculiar spectral statistics of ensembles of trees and star-like graphs
- The Anderson localization transition and eigenfunction multifractality in an ensemble of ultrametric random matrices
- Spectral density of sparse sample covariance matrices
Cited in
(6)- \(p\)-adic mathematical physics: the first 30 years
- Lifshitz tails at spectral edge and holography with a finite cutoff
- Peculiar spectral statistics of ensembles of trees and star-like graphs
- Generalized devil's staircase and RG flows
- Random hierarchical matrices: spectral properties and relation to polymers on disordered trees
- On the logistic behaviour of the topological ultrametricity of data
This page was built for publication: Native ultrametricity of sparse random ensembles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994558)