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

DOI10.1016/J.AMC.2018.06.056MaRDI QIDQ2335795zbMATH OpenOpenAlexFDO

Authors Chengyong Wang, Ziliang Guo, Shuchao Li

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

\(k\)-triangle graphdegree-Kirchhoff indexhitting timeKemeny's constantspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Hitting times for random walks on tricyclic graphs
• Hitting times for random walks on subdivision and triangulation graphs
• Expected hitting times for random walks on quadrilateral graphs and their applications
• Expected hitting times for a random walk on a connected graph
• Bounds on expected hitting times for a random walk on a connected graph
• Hitting times for random walks on vertex-transitive graphs
• Expected hitting and cover times of random walks on some special graphs
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs
• An explicit formula of hitting times for random walks on graphs

Cites work

• A collection of results concerning electric resistance and simple random walk on distance-regular graphs
• A note on expected hitting times for birth and death chains
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• An explicit formula of hitting times for random walks on graphs
• An introduction to the theory of graph spectra
• Bounds on expected hitting times for a random walk on a connected graph
• Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
• Chung-Yau invariants and graphs with symmetric hitting times
• Decomposing hitting times of walks on graphs into simpler ones
• Discrete Green's functions and random walks on graphs
• Expected hitting and cover times of random walks on some special graphs
• Expected hitting times for a random walk on a connected graph
• Graph theory
• Hitting times for random walks on subdivision and triangulation graphs
• Hitting times for random walks on vertex-transitive graphs
• Hitting times, cover cost, and the Wiener index of a tree
• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 3163289 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
• On a conjecture concerning spanning tree invariants and loop systems
• On the Ihara zeta function and resistance distance-based indices
• On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• Random walks and the effective resistance of networks
• Random walks on the triangular prism and other vertex-transitive graphs
• Resistance distance and the normalized Laplacian spectrum
• Spanning trees and random walks on weighted graphs
• The electrical resistance of a graph captures its commute and cover times
• The expected hitting times for finite Markov chains
• The expected hitting times for graphs with cutpoints.
• The hitting and cover times of random walks on finite graphs using local degree information
• The hitting time of multiple random walks
• The normalized Laplacian spectrum of quadrilateral graphs and its applications
• The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
• The role of Kemeny's constant in properties of Markov chains

Cited in

(10)

• Expected hitting times for a random walk on a connected graph
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Bounds on Kemeny's constant of trees with a prescribed matching number
• Hitting times for random walks on subdivision and triangulation graphs
• Expected hitting times for random walks on quadrilateral graphs and their applications
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
• Extremal hitting times of trees with some given parameters
• The normalized Laplacian spectrum of n -polygon graphs and applications
• Fractal and first-passage properties of a class of self-similar networks
• On the weighted reverse cover cost of trees and unicyclic graphs with given diameter

This page was built for publication: Expected hitting times for random walks on the \(k\)-triangle graph and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335795)