Scaling of average receiving time and average weighted shortest path on weighted-crystal network

DOI10.1088/1742-5468/ac1409OpenAlexW3194737027MaRDI QIDQ5152561

Xiao-Yan Li, Jun Li, Yu Sun

Publication date: 24 September 2021

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1742-5468/ac1409

zbMATH Keywords

network dynamicsfirst passagetraffic modelsmessage-passing algorithms

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• On the Laplacian spectra of some variants of corona
• Network coherence and eigentime identity on a family of weighted fractal networks
• Weighted average geodesic distance of Vicsek network
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Exact results for the first-passage properties in a class of fractal networks
• ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK
• SCALE-FREE AND SMALL-WORLD PROPERTIES OF A SPECIAL HIERARCHICAL NETWORK
• MEAN TIME TO ABSORPTION ON THE JOINT SIERPINSKI GASKET
• AVERAGE DISTANCE OF SIERPINSKI-LIKE CARPET
• NODE-WEIGHTED AVERAGE DISTANCES OF NETWORKS MODELED ON THREE-DIMENSIONAL VICSEK FRACTAL
• MEAN GEODESIC DISTANCE OF n-LEVEL SIERPINSKI CARPET
• THE POWER FUNCTION HIDDEN IN THE VULNERABILITY OF FRACTAL COMPLEX NETWORKS
• SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS
• AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS
• THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE
• RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES

This page was built for publication: Scaling of average receiving time and average weighted shortest path on weighted-crystal network