Hitting times for random walks on subdivision and triangulation graphs

DOI10.1080/03081087.2017.1287159zbMath1387.05241OpenAlexW2583730962MaRDI QIDQ4640054

Hai-Yan Chen

Publication date: 16 May 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2017.1287159

zbMATH Keywords

hitting timetriangulation graphsubdivision graphmultiplicative degree-Kirchhoff index

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Random walks on graphs (05C81)

Related Items

Some further results on the maximal hitting times of trees with some given parameters, Extremal hitting times of trees with some given parameters, Hitting times for random walks on tricyclic graphs, The normalized Laplacian spectrum of n -polygon graphs and applications, 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, The hitting times of random walks on bicyclic graphs, Expected hitting times for random walks on the \(k\)-triangle graph and their applications, The hitting time of random walk on unicyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• Random walks and the effective resistance sum rules
• Random walks and the effective resistance of networks
• Resistance distance and the normalized Laplacian spectrum
• 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
• On hitting times of random walks on trees
• 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 expected hitting times for graphs with cutpoints.
• Decomposing hitting times of walks on graphs into simpler ones
• The Kirchhoff index of subdivisions of graphs
• An explicit formula of hitting times for random walks on graphs
• Hitting and commute times in large graphs are often misleading
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• The spectrum of the edge corona of two graphs
• Hitting times for random walks on vertex-transitive graphs
• Maximum hitting time for random walks on graphs
• Expected hitting and cover times of random walks on some special graphs