Real-space renormalization group for spectral properties of hierarchical networks
From MaRDI portal
Publication:3452288
Abstract: We derive the determinant of the Laplacian for the Hanoi networks and use it to determine their number of spanning trees (or graph complexity) asymptotically. While spanning trees generally proliferate with increasing average degree, the results show that modifications within the basic patterns of design of these hierarchical networks can lead to significant variations in their complexity. To this end, we develop renormalization group methods to obtain recursion equations from which many spectral properties can be obtained. This provides the basis for future applications to explore the physics of several dynamic processes.
Recommendations
- Evaluation of spectral zeta-functions with the renormalization group
- Spectra of generalized compositions of graphs and hierarchical networks
- The spectral dimension of simplicial complexes: a renormalization group theory
- Geometry and dynamics for hierarchical regular networks
- Properties and applications of Laplacian spectra for Koch networks
Cited in
(5)- The spectral dimension of simplicial complexes: a renormalization group theory
- Evaluation of spectral zeta-functions with the renormalization group
- Iterated networks and the spectra of renormalizable electromechanical systems
- A key heterogeneous structure of fractal networks based on inverse renormalization scheme
- Geometry and dynamics for hierarchical regular networks
This page was built for publication: Real-space renormalization group for spectral properties of hierarchical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452288)