Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks

DOI10.1016/j.physa.2014.03.088zbMath1395.60115OpenAlexW2022349126MaRDI QIDQ1782880

Meifeng Dai, Yu Sun, Li-Feng Xi

Publication date: 20 September 2018

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

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

zbMATH Keywords

mean first-passage timeaverage receiving timeaverage weighted shortest pathweighted hierarchical network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (14)

Scaling of weighted spectral distribution in deterministic scale-free networks ⋮ Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk ⋮ MFPT calculation for random walks in inhomogeneous networks ⋮ Average weighted receiving time on the non-homogeneous double-weighted fractal networks ⋮ The modified box dimension and average weighted receiving time of the weighted hierarchical graph ⋮ Network coherence and eigentime identity on a family of weighted fractal networks ⋮ Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks ⋮ Weighted average geodesic distance of Vicsek network ⋮ Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks ⋮ FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS ⋮ Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket ⋮ AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS ⋮ ASYMPTOTIC FORMULA OF AVERAGE DISTANCES ON FRACTAL NETWORKS MODELED BY SIERPINSKI TETRAHEDRON ⋮ GEODESIC DISTANCE ON LALLEY–GATZOURAS CARPETS

Cites Work

• Metric structure of random networks
• Complex networks: structure and dynamics
• A Guide to First-Passage Processes
• Scaling of average sending time on weighted Koch networks
• Statistical mechanics of complex networks
• The exact solution of the mean geodesic distance for Vicsek fractals
• A comment on the solutions of the equation ∇× a = ka
• Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks

This page was built for publication: Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks