scientific article; zbMATH DE number 7166402

zbMath1430.05073MaRDI QIDQ5215582

Steve Butler, Kate J. Lorenzen, Jacob Riesen, Jane Breen, Haoyang Qian, Colt Dearmond, Nicklas Day

Publication date: 12 February 2020

Full work available at URL: https://journals.uwyo.edu/index.php/ela/article/view/5175

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov chainnormalized LaplacianKemeny's constanttwin subgraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

Related Items

Kemeny's constant for nonbacktracking random walks, An Edge Centrality Measure Based on the Kemeny Constant, Kemeny's constant and the Kirchhoff index for the cluster of highly symmetric graphs, A 1-separation formula for the graph Kemeny constant and Braess edges

Cites Work

• Unnamed Item
• The maximum relaxation time of a random walk
• Non-negative matrices and Markov chains.
• Algebraic aspects of the normalized Laplacian
• Maximum hitting time for random walks on graphs
• Kemeny's Constant and the Random Surfer
• Using twins and scaling to construct cospectral graphs for the normalized Laplacian