ASYMPTOTIC FORMULA OF AVERAGE DISTANCES ON FRACTAL NETWORKS MODELED BY SIERPINSKI TETRAHEDRON

DOI10.1142/S0218348X19501202zbMath1434.28017MaRDI QIDQ5108650

Qin Wang, Juan Deng

Publication date: 5 May 2020

Published in: Fractals (Search for Journal in Brave)

zbMATH Keywords

self-similarity; renewal theorem; fractal; geodesic distance; Sierpinski tetrahedron

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

28A80: Fractals

05C12: Distance in graphs

Related Items

AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
• Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
• Fractal and complex network analyses of protein molecular dynamics
• Scale-free effect of substitution networks
• Fractality of evolving self-similar networks
• Eigentime identities of fractal sailboat networks
• Geodesic distances and intrinsic distances on some fractal sets
• Scaling of average sending time on weighted Koch networks
• Emergence of Scaling in Random Networks
• The exact solution of the mean geodesic distance for Vicsek fractals
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
• ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK
• MARKOV SPECTRA OF SELF-SIMILAR NETWORKS BY SUBSTITUTION RULE
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI CARPET
• Collective dynamics of ‘small-world’ networks