Average weighted receiving time on the non-homogeneous double-weighted fractal networks
From MaRDI portal
Publication:1620565
DOI10.1016/j.physa.2017.01.013zbMath1400.05228MaRDI QIDQ1620565
Dandan Ye, Meifeng Dai, Yu Sun, Wei Yi Su
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
non-homogeneous; weight factor; fractal network; average weighted receiving time; double-weighted network
05C82: Small world graphs, complex networks (graph-theoretic aspects)
90B10: Deterministic network models in operations research
28A80: Fractals
Related Items
EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS, ALGORITHM TO CALCULATE THE FRACTAL DIMENSION AND NUMERICAL INTEGRATION OF FLUCTUATING CONTINUOUS FUNCTIONS, CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE, Eigentime identities for random walks on a family of treelike networks and polymer networks, Spectral analysis for a family of treelike networks, Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk, Methodology for the characterization of the electrical power demand curve, by means of fractal orbit diagrams on the complex plane of Mandelbrot set
Cites Work
- Unnamed Item
- Unnamed Item
- Trapping time of weighted-dependent walks depending on the weight factor
- Distribution characteristics of weighted bipartite evolving networks
- Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Average weighted trapping time of the node- and edge-weighted fractal networks
- A Guide to First-Passage Processes
- Scaling of average sending time on weighted Koch networks
- Statistical mechanics of complex networks
- Random walks on non-homogenous weighted Koch networks
- Deterministic scale-free networks
