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

DOI10.1016/J.PHYSA.2014.03.088zbMATH Open1395.60115OpenAlexW2022349126MaRDI QIDQ1782880FDOQ1782880

Authors: Yu Sun, Meifeng Dai, Lifeng 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

Recommendations

• Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks
• THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
• Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
• The modified box dimension and average weighted receiving time of the weighted hierarchical graph
• scientific article; zbMATH DE number 6932983

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Statistical mechanics of complex networks
• Complex networks: structure and dynamics
• A guide to first-passage processes
• Metric structure of random networks
• Mean commute time for random walks on hierarchical scale-free networks
• Scaling of average sending time on weighted Koch networks
• The exact solution of the mean geodesic distance for Vicsek fractals
• A comment on the solutions of the equation ∇× a = ka

Cited In (16)

• THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
• GEODESIC DISTANCE ON LALLEY–GATZOURAS CARPETS
• Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk
• Scaling of weighted spectral distribution in deterministic scale-free networks
• 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
• Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks
• Asymptotic formula of average distances on fractal networks modeled by Sierpinski tetrahedron
• Weighted average geodesic distance of Vicsek network
• Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
• Average geodesic distance of node-weighted Sierpinski networks
• First-order network coherence and eigentime identity on the weighted Cayley networks
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782880)