Abstract
The recently introduced hierarchical regular networks HN3 and HN4 are analyzed in detail. We use renormalization group arguments to show that HN3, a 3-regular planar graph, has a diameter growing as with the system size, and random walks on HN3 exhibit super-diffusion with an anomalous exponent dw = 2 − log2(ϕ) ≈ 1.306, where is the ‘golden ratio.’ In contrast, HN4, a non-planar 4-regular graph, has a diameter that grows slower than any power of N, yet, faster than any power of ln N. In an annealed approximation we can show that diffusive transport on HN4 occurs ballistically (dw = 1). Walkers on both graphs possess a first-return probability with a power law tail characterized by an exponent μ = 2 − 1/dw. It is shown explicitly that recurrence properties on HN3 depend on the starting site.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.