Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk

DOI10.1016/j.physa.2018.08.172MaRDI QIDQ2155057

Yu Sun, Tingting Ju, Meifeng Dai, Jianwei Chang, Wei Yi Su, Jing-Yi Liu, Dong-Lei Tang

Publication date: 15 July 2022

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

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

zbMATH Keywords

eigenvalue; Laplacian spectrum; scale-free; eigentime identity; weighted triangulation network

Mathematics Subject Classification ID

82-XX: Statistical mechanics, structure of matter

Related Items

AVERAGE DISTANCES OF LINDSTRÖM SNOWFLAKE NETWORKS, SELF-SIMILAR TOUCHING NETWORKS — PART I, SELF-SIMILAR TOUCHING NETWORKS — PART II, EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS, AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS, On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks, Eigenvalues of transition weight matrix for a family of weighted networks, Generalized adjacency and Laplacian spectra of the weighted corona graphs

Cites Work

• From first-passage times of random walks in confinement to geometry-controlled kinetics
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• Recursive weighted treelike networks
• Scale-free and small-world properties of Sierpinski networks
• Average weighted receiving time on the non-homogeneous double-weighted fractal networks
• An iteration method for computing the total number of spanning trees and its applications in graph theory
• Eigentime identities for random walks on a family of treelike networks and polymer networks
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Spanning trees and random walks on weighted graphs
• Random walks on non-homogenous weighted Koch networks
• Kemeny's Constant and the Random Surfer
• FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS