Related Experiment Video
Updated: Mar 8, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Eigenvalue tunneling and decay of quenched random network
V Avetisov1,2, M Hovhannisyan3, A Gorsky4,5
1N. N. Semenov Institute of Chemical Physics of the Russian Academy of Sciences, 119991 Moscow, Russia.
Abstract:
We consider the canonical ensemble of N-vertex Erdős-Rényi (ER) random topological graphs with quenched vertex degree, and with fugacity μ 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, μ_{c}, where p is the ER bond formation probability. Evolution of the spectral density, ρ(λ), of the adjacency matrix with increasing μ leads to the formation of a multizonal support for μ>μ_{c}. Eigenvalue tunneling from the central zone to the side one means formation of a new clique in the defragmentation process. The adjacency matrix of the network ground state has a block-diagonal form, where the number of vertices in blocks fluctuates 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.
Related Concept Videos
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
Current Growth And Decay In RL Circuits
Propagation of Uncertainty from Random Error
The Entropy as a State Function
Network Function of a Circuit
Resting Potential Decay
At rest, the K+ is the main ion that moves across the membrane...
