Kemeny's constant and global mean first passage time of random walks on octagonal cell network

DOI10.1002/mma.9046zbMath1527.05161MaRDI QIDQ6139311

Asad Ullah, Shahid Zaman

Publication date: 18 December 2023

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

zbMATH Keywords

random walkmean first passage timeKemeny's constantoctagonal cell network

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Stopping times; optimal stopping problems; gambling theory (60G40) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
• The electrical resistance of a graph captures its commute and cover times
• The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
• Cacti with maximal general sum-connectivity index
• On connected graphs having the maximum connective eccentricity index
• A Guide to First-Passage Processes
• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• Network formation determined by the diffusion process of random walkers
• Why is Kemeny’s constant a constant?
• Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons
• On the normalized Laplacians with some classical parameters involving graph transformations
• Analysis of Markov Influence Graphs
• First-Passage Phenomena and Their Applications

This page was built for publication: Kemeny's constant and global mean first passage time of random walks on octagonal cell network