Native ultrametricity of sparse random ensembles

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 $\eta$-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.

24 pages, 9 figures

References in corpus (9)

• p-Adic Mathematical Physics
• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• Spectra of Sparse Random Matrices
• Kinetic Theory of Random Graphs: from Paths to Cycles
• Eternal Symmetree
• Unicyclic Components in Random Graphs
• Dynamics of Random Graphs with Bounded Degrees
• Kinetics of Ring Formation
• The Continuum of Discrete Trajectories in Eternal Inflation

Cited by in corpus (6)

• $p$-Adic Mathematical Physics: The First 30 Years
• Eigenvalue tunnelling and decay of quenched random networks
• Generalized Devil's staircase and RG flows
• Stretching of a fractal polymer around a disc reveals KPZ-like statistics
• Lifshitz tails at spectral edge and holography with a finite cutoff
• Number-theoretic aspects of 1D localization: "popcorn function" with Lifshitz tails and its continuous approximation by the Dedekind $\eta$