Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
From MaRDI portal
Publication:2149729
DOI10.1016/J.PHYSA.2018.04.087OpenAlexW2799919143WikidataQ129969217 ScholiaQ129969217MaRDI QIDQ2149729
Publication date: 29 June 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2018.04.087
Related Items (5)
WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS ⋮ The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network ⋮ Mean first-passage times for two biased walks on the weighted rose networks ⋮ EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS ⋮ CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE
Cites Work
- Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree
- Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
- Complex networks modeled on the Sierpinski gasket
- Scale-free and small-world properties of Sierpinski networks
- The modified box dimension and average weighted receiving time of the weighted hierarchical graph
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Average geodesic distance of skeleton networks of Sierpinski tetrahedron
- Effect of trap position on the efficiency of trapping in treelike scale-free networks
- Emergence of Scaling in Random Networks
- Random walks on non-homogenous weighted Koch networks
- AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
- FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
- Collective dynamics of ‘small-world’ networks
This page was built for publication: Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
