A class of scale-free networks with fractal structure based on subshift of finite type
From MaRDI portal
Publication:5347049
DOI10.1063/1.4902416zbMath1361.34026OpenAlexW2061665658WikidataQ50986492 ScholiaQ50986492MaRDI QIDQ5347049
Li-Feng Xi, Zhi Xiong Wen, Meifeng Dai, Jin Chen
Publication date: 19 May 2017
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.4902416
Time series analysis of dynamical systems (37M10) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Synchronization of solutions to ordinary differential equations (34D06)
Related Items
Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk ⋮ The modified box dimension and average weighted receiving time of the weighted hierarchical graph ⋮ Spectral analysis for weighted tree-like fractals ⋮ Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks ⋮ Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure ⋮ Fractal analysis of recurrence networks constructed from the two-dimensional fractional Brownian motions ⋮ The 3-cycle weighted spectral distribution in evolving community-based networks ⋮ SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
Cites Work
- Random walks and the effective resistance of networks
- Eigenvalues and expanders
- Subshifts of finite type and sofic systems
- Hausdorff dimensions of sofic affine-invariant sets
- Harnack inequalities for graphs with non-negative Ricci curvature
- Generating hierarchial scale-free graphs from fractals
- Markov partitions and \(C\)-diffeomorphisms
- Construction of Markov partitions
- Xheal
- Equilibrium states and the ergodic theory of Anosov diffeomorphisms
- Deterministic scale-free networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item