A Hitting Time Formula for the Discrete Green's Function

DOI10.1017/S0963548315000152zbMath1372.05206arXiv1505.06989MaRDI QIDQ5366895

Andrew Beveridge

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.06989

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Related Items (5)

Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ Symmetric Measures, Continuous Networks, and Dynamics ⋮ Forest formulas of discrete Green's functions ⋮ Oriented spanning trees and stationary distribution of digraphs ⋮ Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact mixing times for random walks on trees
• The best mixing time for random walks on trees
• Discrete Green's functions
• Discrete Green's functions and random walks on graphs
• Mixing times for uniformly ergodic Markov chains
• Computing Diffusion State Distance Using Green’s Function and Heat Kernel on Graphs
• Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry
• Collisions Among Random Walks on a Graph
• Occupation measures for Markov chains
• Reversal of Markov Chains and the Forget Time
• Exit Frequency Matrices for Finite Markov Chains
• Centers for Random Walks on Trees

This page was built for publication: A Hitting Time Formula for the Discrete Green's Function