Expected hitting times for random walks on the \(k\)-triangle graph and their applications

DOI10.1016/j.amc.2018.06.056zbMath1427.05214OpenAlexW2884767994MaRDI QIDQ2335795

Shuchao Li, Chengyong Wang, Ziliang Guo

Publication date: 15 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.06.056

zbMATH Keywords

spanning treehitting timedegree-Kirchhoff indexKemeny's constant\(k\)-triangle graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Sums of independent random variables; random walks (60G50) Distance in graphs (05C12) Random walks on graphs (05C81)

Related Items

Further results on the expected hitting time, the cover cost and the related invariants of graphs, Extremal hitting times of trees with some given parameters, The normalized Laplacian spectrum of n -polygon graphs and applications, Bounds on Kemeny's constant of trees with a prescribed matching number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Ihara zeta function and resistance distance-based indices
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• On a conjecture concerning spanning tree invariants and loop systems
• Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
• Random walks and the effective resistance of networks
• Resistance distance and the normalized Laplacian spectrum
• A collection of results concerning electric resistance and simple random walk on distance-regular graphs
• Bounds on expected hitting times for a random walk on a connected graph
• The expected hitting times for finite Markov chains
• The hitting and cover times of random walks on finite graphs using local degree information
• Random walks on the triangular prism and other vertex-transitive graphs
• Expected hitting times for a random walk on a connected graph
• A note on expected hitting times for birth and death chains
• The electrical resistance of a graph captures its commute and cover times
• The expected hitting times for graphs with cutpoints.
• The normalized Laplacian spectrum of quadrilateral graphs and its applications
• More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
• Discrete Green's functions and random walks on graphs
• Spanning trees and random walks on weighted graphs
• Decomposing hitting times of walks on graphs into simpler ones
• The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
• An explicit formula of hitting times for random walks on graphs
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• The Hitting Time of Multiple Random Walks
• Hitting times for random walks on vertex-transitive graphs
• Expected hitting and cover times of random walks on some special graphs
• Hitting times for random walks on subdivision and triangulation graphs
• Chung-Yau Invariants and Graphs with Symmetric Hitting Times
• ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
• The Role of Kemeny's Constant in Properties of Markov Chains