Real-Space Renormalization Group for Spectral Properties of Hierarchical Networks
arXiv:1505.06395 · doi:10.1088/1751-8113/48/41/415001
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.
arXiv comment14 pages, RevTex, 2 pdf figures. Numerous corrections and improvements. For related work, see http://www.physics.emory.edu/faculty/boettcher/
References in corpus (28)
- Spatial Networks
- Critical phenomena in complex networks
- Hierarchical structure and the prediction of missing links in networks
- Synchronization in small-world systems
- Spatial search by quantum walk
- Hierarchical modularity in human brain functional networks
- Griffiths phases and the stretching of criticality in brain networks
- The abelian sandpile and related models
- Synchronization is optimal in non-diagonalizable networks
- Transport in weighted networks: Partition into superhighways and roads
- Spanning Trees on Graphs and Lattices in d Dimensions
- Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
- Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations
- Hierarchy Measures in Complex Networks
- Spanning trees on the Sierpinski gasket
- Ordinary Percolation with Discontinuous Transitions
- Quantum walk approach to search on fractal structures
- Small-World Bonds and Patchy Percolation on the Hanoi Network
- From Dyson to Hopfield: Processing on hierarchical networks
- Hierarchical neural networks perform both serial and parallel processing
- Fixed Point Properties of the Ising Ferromagnet on the Hanoi Networks
- Generalized scaling theory for critical phenomena including essential singularity and infinite dimensionality
- Quantum Transport through Hierarchical Structures
- Hierarchical scale-free network is fragile against random failure
- Classification of critical phenomena in hierarchical small-world networks
- Topological properties of hierarchical networks
- Intermittent relaxation in hierarchical energy landscapes
- Absence of the non-percolating phase for percolation on the non-planar Hanoi network
Cited by in corpus (8)
- Continuous Time Quantum Walks in finite Dimensions
- The Chiral Potts Spin Glass in d=2 and 3 Dimensions
- Phase Transitions between Different Spin-Glass Phases and between Different Chaoses in Quenched Random Chiral Systems
- Devil's Staircase Continuum in the Chiral Clock Spin Glass with Competing Ferromagnetic-Antiferromagnetic and Left-Right Chiral Interactions
- Stepwise Positional-Orientational Order and the Multicritical-Multistructural Global Phase Diagram of the s=3/2 Ising Model from Renormalization-Group Theory
- The Griffiths Phase on Hierarchical Modular Networks with Small-world Edges
- Evaluation of Spectral Zeta-Functions with the Renormalization Group
- Quantum Ultra-Walks: Walks on a Line with Hierarchical Spatial Heterogeneity