Average weighted receiving time on the non-homogeneous double-weighted fractal networks

DOI10.1016/J.PHYSA.2017.01.013zbMATH Open1400.05228OpenAlexW2577602155MaRDI QIDQ1620565FDOQ1620565

Authors: Dandan Ye, Meifeng Dai, Yu Sun, Su Weiyi 

Publication date: 13 November 2018

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

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

Recommendations

• Random walks on non-homogenous weighted Koch networks
• Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Average homogeneous and non-homogeneous weighted receiving time in recursive weighted Koch networks
• Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks

zbMATH Keywords

non-homogeneousweight factorfractal networkaverage weighted receiving timedouble-weighted network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80)

Cites Work

• Statistical mechanics of complex networks
• A guide to first-passage processes
• Title not available (Why is that?)
• Large scale structure and dynamics of complex networks. From information technology to finance and natural science.
• Trapping time of weighted-dependent walks depending on the weight factor
• Deterministic scale-free networks
• Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
• Scaling of average sending time on weighted Koch networks
• Distribution characteristics of weighted bipartite evolving networks
• Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Random walks on non-homogenous weighted Koch networks

Cited In (9)

• Eigentime identities for random walks on a family of treelike networks and polymer networks
• Algorithm to calculate the fractal dimension and numerical integration of fluctuating continuous functions
• EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
• Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks
• Spectral analysis for a family of treelike networks
• Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks
• Methodology for the characterization of the electrical power demand curve, by means of fractal orbit diagrams on the complex plane of Mandelbrot set
• CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE
• Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk

This page was built for publication: Average weighted receiving time on the non-homogeneous double-weighted fractal networks

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