Eigenvalue tunnelling and decay of quenched random networks

Abstract

We consider the canonical ensemble of $N$-vertex Erdős-Rényi (ER) random topological graphs with quenched vertex degree, and with fugacity $\mu$ for each closed triple of bonds. We claim complete defragmentation of large-$N$ graphs into the collection of $[p^{-1}]$ almost full subgraphs (cliques) above critical fugacity, ${\mu }_c$, where $p$ is the ER bond formation probability. Evolution of the spectral density, $\rho (\lambda )$, of the adjacency matrix with increasing $\mu$ leads to the formation of two-zonal support for $\mu >{\mu }_c$. Eigenvalue tunneling from one (central) zone to the other means formation of a new clique in the defragmentation process. The adjacency matrix of the ground state of a network has the block-diagonal form where number of vertices in blocks fluctuate around the mean value $Np$. The spectral density of the whole network in this regime has triangular shape. We interpret the phenomena from the viewpoint of the conventional random matrix model and speculate about possible physical applications.

arXiv comment6 pages, 5 figures (text updated, one extra figure added)

References in corpus (25)

• Specificity and stability in topology of protein networks
• Critical phenomena in complex networks
• Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
• Topological Strings and Integrable Hierarchies
• Graph spectra and the detectability of community structure in networks
• Lectures on non-perturbative effects in large N gauge theories, matrix models and strings
• Strings from Tachyons
• Spectra of complex networks
• Spectra and eigenvectors of scale-free networks
• From chiral Random Matrix Theory to chiral Perturbation Theory
• D-brane Decay in Two-Dimensional String Theory
• Network geometry with flavor: from complexity to quantum geometry
• Non-Perturbative Effects in Matrix Models and Vacua of Two Dimensional Gravity
• A paradigm of open/closed duality: Liouville D-branes and the Kontsevich model
• Solution for the properties of a clustered network
• Spectra of random graphs with arbitrary expected degrees
• Network Transitivity and Matrix Models
• Clustering implies geometry in networks
• Chiral Disorder in QCD
• Spectra of random graphs with community structure and arbitrary degrees
• Quantum Gravity as an Information Network: Self-Organization of a 4D Universe
• Native ultrametricity of sparse random ensembles
• Islands of stability in motif distributions of random networks
• New aspects of two-dimensional quantum gravity
• Spontaneous Symmetry Breaking and Phase Coexistence in Two-Color Networks

Cited by in corpus (16)

• Network Geometry and Complexity
• Phase transitions in social networks inspired by the Schelling model
• Interacting Thermofield Doubles and Critical Behavior in Random Regular Graphs
• Self-isolation or borders closing: what prevents epidemic spreading better?
• Mobility Edge in the Anderson model on partially disordered random regular graphs
• Anatomy of the fragmented Hilbert space: eigenvalue tunneling, quantum scars and localization in the perturbed random regular graph
• Paths counting on simple graphs: from escape to localization
• Exactly Solvable Random Graph Ensemble with Extensively Many Short Cycles
• Finite plateau in spectral gap of polychromatic constrained random networks
• Robust extended states in Anderson model on partially disordered random regular graphs
• A Flow in the Forest
• Lifshitz tails at spectral edge and holography with a finite cutoff
• Finite-size effects in exponential random graphs and cluster evaporation
• Phase transitions in atypical systems induced by a condensation transition on graphs
• Free-energy density functional for Strauss's model of transitive networks
• Non-backtracking walks reveal compartments in sparse chromatin interaction networks