For a random walk say from point $x$ to $y$ on a graph,
How is the probability of a Random walker reaching point $y$ before returning to $x$ related to the expected of the number of visits to point $x$, $E(T_{x})$ and the expected number of visits to y, $E(T_{y})$ after infinitely many steps? (If there does exist one can you please prove it)