Eigenvalues of transition weight matrix for a family of weighted networks

DOI10.1515/math-2022-0464zbMath1503.05079OpenAlexW4312913471MaRDI QIDQ2111824

Mingjun Zhang, Jing Su, Xiao-Min Wang, Bing Yao

Publication date: 17 January 2023

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2022-0464

zbMATH Keywords

Laplacian eigenvaluerandom walkweighted networkrandom target access timeweighted spanning tree

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

Cites Work

• On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• Random walks and diffusion on networks
• The number of spanning trees of a class of self-similar fractal models
• Characterization, verification and generation of strategies in games with resource constraints
• Eigentime identities for random walks on a family of treelike networks and polymer networks
• Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
• On the normalized Laplacian spectral radius, Laplacian incidence energy and Kemeny's constant
• A note on domination number in maximal outerplanar graphs
• Kemeny's Constant and the Random Surfer
• Trapping efficiency of random walks on weighted scale-free trees
• Random walks on weighted networks: a survey of local and non-local dynamics
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
• Vibration modes of 3n-gaskets and other fractals