The modified box dimension and average weighted receiving time of the weighted hierarchical graph
From MaRDI portal
Publication:1620614
DOI10.1016/j.physa.2017.02.006zbMath1400.05199OpenAlexW2587523352MaRDI QIDQ1620614
Shuxiang Shao, Meifeng Dai, Yanqiu Sun, Wei Yi Su, Li-Feng Xi
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.02.006
Sums of independent random variables; random walks (60G50) Structural characterization of families of graphs (05C75) Fractals (28A80) Fractional graph theory, fuzzy graph theory (05C72)
Related Items
Eigentime identities for random walks on a family of treelike networks and polymer networks, Spectral analysis for a family of treelike networks, Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks, The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network, Generalized adjacency and Laplacian spectra of the weighted corona graphs, CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE, ASYMPTOTIC FORMULA ON AVERAGE PATH LENGTH OF A SPECIAL NETWORK BASED ON SIERPINSKI CARPET, On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks
Cites Work
- Unnamed Item
- Typical behavior of mixed \(L^{\mathbf q}\)-dimensions
- Trapping on modular scale-free and small-world networks with multiple hubs
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Bipartite and directed scale-free complex networks arising from zeta functions
- Generating hierarchial scale-free graphs from fractals
- Multifractal analysis of a measure of multifractal exact dimension
- Scaling of average sending time on weighted Koch networks
- Statistical mechanics of complex networks
- Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks
- A class of scale-free networks with fractal structure based on subshift of finite type
- Deterministic scale-free networks