Mean first-passage times for two biased walks on the weighted rose networks

DOI10.1016/j.physa.2019.01.112OpenAlexW2914921931WikidataQ128413670 ScholiaQ128413670MaRDI QIDQ2158914

Tingting Ju, Meifeng Dai, Changxi Dai, Junjie Shen, Yu Sun, Wei Yi Su

Publication date: 26 July 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2019.01.112

zbMATH Keywords

average receiving timeweight-dependent walkglobal mean first-passage timemaximal entropy walkweighted rose networks

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items (2)

The average trapping time on a half Sierpinski gasket ⋮ WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS

Cites Work

• Unnamed Item
• Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk
• Scale-free and small-world properties of Sierpinski networks
• The relations between network-operation and topological-property in a scale-free and small-world network with community structure
• Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
• Average geodesic distance of skeleton networks of Sierpinski tetrahedron
• Network coherence in the web graphs
• Average weighted trapping time of the node- and edge-weighted fractal networks
• The Structure and Function of Complex Networks
• Coherence analysis of a class of weighted networks
• MULTIFRACTAL ANALYSIS OF ONE-DIMENSIONAL BIASED WALKS
• ASYMPTOTIC FORMULA ON AVERAGE PATH LENGTH OF A SPECIAL NETWORK BASED ON SIERPINSKI CARPET
• EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
• AVERAGE DISTANCE OF SELF-SIMILAR FRACTAL TREES
• SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS

This page was built for publication: Mean first-passage times for two biased walks on the weighted rose networks