Exact hitting time formulas for Cayley graphs
From MaRDI portal
Cites work
- A hitting time formula for the discrete Green's function
- Digraph Laplacian and the degree of asymmetry
- Discrete Green's functions
- Discrete Green's functions and random walks on graphs
- Expected hitting times for random walks on quadrilateral graphs and their applications
- Extremal hitting times of trees with some given parameters
- Further results on the expected hitting time, the cover cost and the related invariants of graphs
- Generalized inverse of the Laplacian matrix and some applications
- Hitting time, resistance distance and Kirchhoff index of Cayley graphs over dicyclic and semi-dihedral groups
- Hitting times for random walks on subdivision and triangulation graphs
- Hitting times for random walks on vertex-transitive graphs
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- Laplacian matrices of graphs: A survey
- On the average hitting times of \(\operatorname{Cay} (\mathbb{Z}_N, \{+1, +2\})\)
- Random walks on edge transitive graphs
- Random walks on edge-transitive graphs. II
- Some further results on the maximal hitting times of trees with some given parameters
- Some properties of unitary Cayley graphs
- The hitting time of random walk on unicyclic graphs
- The hitting times of random walks on bicyclic graphs
This page was built for publication: Exact hitting time formulas for Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285427)
