How do you find the expected Cover Time of a graph?

462 Views Asked by At

I can only find resources that give an upper bound on the cover time, but not how to find the exact expected cover time of a graph. Somebody told me it's related to the coupon collector problem, but I have no idea how to use this information. Also is solving for the cover time a different procedure depending on whether the graph is ergodic or not? Any help is greatly appreciated, thanks.