Scale-free effect of substitution networks
From MaRDI portal
Publication:2148263
DOI10.1016/J.PHYSA.2017.11.072OpenAlexW2770935697MaRDI QIDQ2148263FDOQ2148263
Authors: Ziyu Li, Zhouyu Yu, Lifeng Xi 
Publication date: 23 June 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2017.11.072
Recommendations
Cites Work
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Collective dynamics of ‘small-world’ networks
- Networks. An introduction.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Substitutions in dynamics, arithmetics and combinatorics
- Directions in Mathematical Quasicrystals
- Undecidability and nonperiodicity for tilings of the plane
- Fractality and scale-free effect of a class of self-similar networks
Cited In (22)
- ASYMPTOTIC FORMULA OF AVERAGE DISTANCES ON FRACTAL NETWORKS MODELED BY SIERPINSKI TETRAHEDRON
- MARKOV SPECTRA OF SELF-SIMILAR NETWORKS BY SUBSTITUTION RULE
- Link investment substitutability: a factor influencing network formation
- MULTIPLE REPRESENTATIONS OF REAL NUMBERS ON SELF-SIMILAR SETS WITH OVERLAPS
- FRACTALITY OF SUBSTITUTION NETWORKS
- AVERAGE DISTANCE OF SUBSTITUTION NETWORKS
- ARITHMETIC ON MORAN SETS
- AVERAGE DISTANCES OF A FAMILY OF NON-P.C.F. SELF-SIMILAR NETWORKS
- AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS
- Searching efficiency of multiple walkers on the weighted networks
- The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
- Fractality of evolving self-similar networks
- AVERAGE DISTANCES OF LINDSTRÖM SNOWFLAKE NETWORKS
- SELF-SIMILAR TOUCHING NETWORKS — PART I
- Fractality of multiple colored substitution networks
- Average distances on substitution trees
- On the scale-freeness of random colored substitution networks
- Generalized adjacency and Laplacian spectra of the weighted corona graphs
- AVERAGE FERMAT DISTANCES OF TWO-COLORED SUBSTITUTION NETWORKS
- CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE
- SELF-SIMILAR TOUCHING NETWORKS — PART II
- Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
This page was built for publication: Scale-free effect of substitution networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148263)
