Generating hierarchial scale-free graphs from fractals
From MaRDI portal
Publication:2393182
DOI10.1016/j.chaos.2011.05.012zbMath1269.05099arXiv1104.1024OpenAlexW2084504453MaRDI QIDQ2393182
Publication date: 7 August 2013
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1024
Random graphs (graph-theoretic aspects) (05C80) Relations of low-dimensional topology with graph theory (57M15)
Related Items
The modified box dimension and average weighted receiving time of the weighted hierarchical graph ⋮ Fractality and scale-free effect of a class of self-similar networks ⋮ ANALYSES OF SOME STRUCTURAL PROPERTIES ON A CLASS OF HIERARCHICAL SCALE-FREE NETWORKS ⋮ Scale-free and small-world properties of a multiple-hub network with fractal structure ⋮ Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks ⋮ A class of scale-free networks with fractal structure based on subshift of finite type ⋮ The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model ⋮ Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure ⋮ FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON ⋮ Fractal networks with Sturmian structure ⋮ Asymptotic degree distribution in a homogeneous evolving network model
Cites Work
- Limits of dense graph sequences
- Dimension and recurrence in hyperbolic dynamics
- Emergence of Scaling in Random Networks
- Graph limits and exchangeable random graphs
- Paths in graphs
- The phase transition in inhomogeneous random graphs
- Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions
- Deterministic scale-free networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item