Fractal and Transfractal Recursive Scale-Free Nets

Abstract

We explore the concepts of self-similarity, dimensionality, and (multi)scaling in a new family of recursive scale-free nets that yield themselves to exact analysis through renormalization techniques. All nets in this family are self-similar and some are fractals - possessing a finite fractal dimension - while others are small world (their diameter grows logarithmically with their size) and are infinite-dimensional. We show how a useful measure of "transfinite" dimension may be defined and applied to the small world nets. Concerning multiscaling, we show how first-passage time for diffusion and resistance between hub (the most connected nodes) scale differently than for other nodes. Despite the different scalings, the Einstein relation between diffusion and conductivity holds separately for hubs and nodes. The transfinite exponents of small world nets obey Einstein relations analogous to those in fractal nets.

Includes small revisions and references added as result of readers' feedback

References in corpus (12)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Assortative mixing in networks
• Evolution of networks
• Mixing patterns in networks
• Resilience of the Internet to random breakdowns
• Self-similarity of complex networks
• Scale-Free Networks are Ultrasmall
• Origins of fractality in the growth of complex networks
• Pseudofractal Scale-free Web
• Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
• Diffusion in scale-free networks with annealed disorder

Cited by in corpus (91)

• Random walks and diffusion on networks
• Nature of the epidemic threshold for the susceptible-infected-susceptible dynamics in networks
• Global mean first-passage times of random walks on complex networks
• First passage time for random walks in heterogeneous networks
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
• Exact calculations of first-passage quantities on recursive networks
• Epidemic Threshold of Susceptible-Infected-Susceptible Model on Complex Networks
• Determining mean first-passage time on a class of treelike regular fractals
• Determination of multifractal dimensions of complex networks by means of the sandbox algorithm
• Portraits of Complex Networks
• Spectral dimensions of hierarchical scale-free networks with shortcuts
• Exact analytical solution of average path length for Apollonian networks
• Multifractality of complex networks
• Random Graph Modeling: A survey of the concepts
• The spectral dimension of simplicial complexes: a renormalization group theory
• Trapping in scale-free networks with hierarchical organization of modularity
• Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
• Close or connected? Distance and connectivity effects on transport in networks
• Concurrence Percolation in Quantum Networks
• Fractal scale-free networks resistant to disease spread
• Random walks in modular scale-free networks with multiple traps
• Counting spanning trees in self-similar networks by evaluating determinants
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Average distance in a hierarchical scale-free network: an exact solution
• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• The Blume-Emery-Griffiths Spin Glass and Inverted Tricritical Points
• Role of fractal dimension in random walks on scale-free networks
• Anomalous behavior of trapping on a fractal scale-free network
• Slow Encounters of Particle Pairs in Branched Structures
• Scaling laws for diffusion on (trans)fractal scale-free networks
• The higher-order spectrum of simplicial complexes: a renormalization group approach
• Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks
• Reentrant and Forward Phase Diagrams of the Anisotropic Three-Dimensional Ising Spin Glass
• Dynamics and Processing in Finite Self-Similar Networks
• Generating-function approach for bond percolations in hierarchical networks
• Comparative Analysis of Box-Covering Algorithms for Fractal Networks
• Recursive weighted treelike networks
• Different thresholds of bond percolation in scale-free networks with identical degree sequence
• Transition from fractal to non-fractal scalings in growing scale-free networks
• Origin of the hub spectral dimension in scale-free networks
• A geometric growth model interpolating between regular and small-world networks
• Scaling theory of fractal complex networks
• Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
• Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
• An ensemble of random graphs with identical degree distribution
• Quantum-Mechanically Induced Asymmetry in the Phase Diagrams of Spin-Glass Systems
• Fractality and degree correlations in scale-free networks
• Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps
• A general model of hierarchical fractal scale-free networks
• A general formulation of long-range degree correlations in complex networks
• Observability transitions in correlated networks
• Hierarchical scale-free network is fragile against random failure
• Unveiling the Importance of Nonshortest Paths in Quantum Networks
• Effects of reciprocity on random walks in weighted networks
• Stochastic and mixed flower graphs
• Structure of percolating clusters in random clustered networks
• Exact eigenvalue spectrum of a class of fractal scale-free networks
• Diffusion-annihilation proecesses in weighted scale-free networks with identical degree sequence
• A Fixed-Mass multifractal approach for unweighted complex networks
• Networks with many structural scales: a Renormalization Group perspective
• Partition of Networks into Basins of Attraction
• A computationally-efficient sandbox algorithm for multifractal analysis of large-scale complex networks with tens of millions of nodes
• Geographical networks stochastically constructed by a self-similar tiling according to population
• The normalized Laplacian spectrum of $n$-polygon graphs and its applications
• Scaling of disordered recursive networks
• Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees
• Spectra, hitting times, and resistance distances of $q$-subdivision graphs
• Transfinite fractal dimension of trees and hierarchical scale-free graphs
• Self-Avoiding Walk on Fractal Complex Networks: Exactly Solvable Cases
• Investigating the Origins of Fractality Based on Two Novel Fractal Network Models
• Fast Algorithm for Relaxation Processes in Big-data Systems
• From Maximum of Intervisit Times to Starving Random Walks
• Degree-ordered percolation on hierarchical scale-free network
• Segregation in the annihilation of two-species reaction-diffusion processes on fractal scale-free networks
• Strange Attractors in Complex Networks
• Response to targeted perturbations for random walks on networks
• Percolation on a maximally disassortative network
• Bifractality of fractal scale-free networks
• Beyond traditional box-covering: Determining the fractal dimension of complex networks using a fixed number of boxes of flexible diameter
• An approximative calculation of the fractal structure in self-similar tilings
• The Essential Synchronization Backbone Problem
• Spanning Trees of Recursive Scale-Free Graphs
• Volatilities analysis of first-passage time and first-return time on a small-world scale-free network
• Combinatorial Properties for a Class of Simplicial Complexes Extended from Pseudo-fractal Scale-free Web
• Model-based reconstruction of real-world fractal complex networks
• Universality classes in the time evolution of epidemic outbreaks on complex networks
• Simple Derivation of the Lifetime and the Distribution of Faces for a Binary Subdivision Model
• Geometric Criticality in Scale-Invariant Networks
• Random walks on bifractal networks
• Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network