Scaling laws for diffusion on (trans)fractal scale-free networks
From MaRDI portal
Publication:4644278
DOI10.1063/1.4997761zbMath1390.28021arXiv1903.03658OpenAlexW3102266310WikidataQ47704650 ScholiaQ47704650MaRDI QIDQ4644278
Publication date: 30 May 2018
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.03658
Deterministic network models in operations research (90B10) Fractals (28A80) Random walks on graphs (05C81)
Related Items
The average trapping time on a half Sierpinski gasket, AVERAGE TRAPPING TIME ON THE 3-DIMENSIONAL 3-LEVEL SIERPINSKI GASKET NETWORK WITH A SET OF TRAP NODES, THE AVERAGE TRAPPING TIME WITH NON-NEAREST-NEIGHBOR JUMPS ON THE LEVEL-3 SIERPINSKI GASKET, Robustness of network coherence in asymmetric unicyclic graphs, EXACT CALCULATIONS OF FIRST-PASSAGE QUANTITIES ON A CLASS OF WEIGHTED TREE-LIKE FRACTAL NETWORKS, The normalized Laplacian spectrum of n -polygon graphs and applications, Eigentime identity of the weighted (m,n)-flower networks, Exact results for the first-passage properties in a class of fractal networks, Constructions and properties of a class of random scale-free networks, EIGENTIME IDENTITIES OF FRACTAL FLOWER NETWORKS, An ensemble of random graphs with identical degree distribution, Trapping efficiency of random walks on weighted scale-free trees
Cites Work
- Unnamed Item
- Unnamed Item
- Laplace eigenvalues of graphs---a survey
- Tutte polynomial of pseudofractal scale-free web
- Statistical mechanics of complex networks
- Detecting network communities: a new systematic and efficient algorithm
- Dynamical Processes on Complex Networks
- Community structure in social and biological networks
- Exact calculations of first-passage properties on the pseudofractal scale-free web
- Probability: A Graduate Course
- First-Passage Phenomena and Their Applications
- A Guide to First-Passage Processes
- Networks
- Deterministic scale-free networks
