Hitting Times of Walks on Graphs through Voltages

We derive formulas for the expected hitting times of general random walks on graphs, in terms of voltages, with very elementary electric means. Under this new light we revise bounds and hitting times for birth-and-deathMarkov chains and for walks on graphs with cutpoints, and give some exact computations on the necklace graph. We also prove Tetali’s formula for hitting times without making use of the reciprocity principle. In fact this principle follows as a corollary of our argument that also yields as corollaries the triangular inequality for effective resistances and the reversibility of the sum of hitting times around a tour.


Introduction
On a finite connected undirected graph = ( , ) with | | = such that the edge between vertices and is given a resistance (or equivalently, a conductance = 1/ ), we can define the random walk on as the Markov chain , ≥ 0, that jumps from its current vertex V to the neighboring vertex with probability V = V / (V), where (V) = ∑ : ∼V V and ∼ V means that is a neighbor of V. There may be a conductance from a vertex to itself, giving rise to a transition probability from to itself, though the most studied case of these random walks on graphs, the simple random walk (SRW), excludes the loops and considers all 's to be equal to 1.
The hitting time of the vertex is the number of jumps that the walk takes until it lands on , and its expected value when the walk starts at is denoted by . The beginner's handbook when studying random walks on graphs from the viewpoint of electric networks is the work of Doyle and Snell [1], which is both a mandatory reference in this area of research and a textbook suitable for undergraduate students. Notably absent from this remarkable monograph is the discussion of hitting times using electric tools. The first such description seems to be due to Chandra et al. [2], where they give the formula for the commute time of the SRW: where | | is the number of edges of the graph and is the effective resistance, as computed by means of Ohm's law, between vertices and .
The commute time + has a nice compact electric formulation, but the one-sided hitting time is a bit more complicated and it was first given by Tetali [3] through a clever use of the superposition principle and the reciprocity theorem for electric networks, yielding the following formula (here we give the simpler version for SRW): where ( ) is the number of neighbors of . In this paper we want to depart from these expressions of expected hitting times in terms of effective resistances and give them instead in terms of voltages, using as tools the material in Doyle and Snell's book, which relies on basic facts of electricity such as Ohm's law and Kirchhoff 's law. We present this alternative expression for two reasons: on the one hand, this representation in terms of voltages leads to very simple proofs of many known results, giving also new insights into new results and computations which are simpler than those involving effective resistances; on the other hand, using Tetali's formula means accepting the deep result of the reciprocity theorem for electric networks, which is outside the realm of Doyle and Snell. With voltages, we will prove Tetali's result without making use of the reciprocity principle. In fact this principle will follow as a corollary of our argument that also yields as corollaries the triangular inequality for effective resistances and the reversibility of the sum of hitting times around a tour.

Expected Hitting Times of Walks on Graphs
We begin with some basic facts from Doyle and Snell that we state as a lemma. Consider a general random walk on a finite graph, let ( < ) be the chance that the walk started at reaches before reaching , and let be the expected number of times the vertex is visited by the walk started at before it reaches . Then we have the following.

Lemma 1. One has
where V is the voltage at when a battery is placed between and such that V = 1 and V = 0 (one will call this setup of the battery scenario 1).
where ( ) = ∑ ∼ is the sum of all conductances emanating from and is the voltage at when a battery is placed between and such that the current entering at is 1 and the voltage at is 0 (one will call this setup of the battery scenario 2).
One also has the relationship Proof. We refer the reader to the book for details, though we can sketch here the main ideas: for (3), we use the fact that both V and ( < ) are harmonic functions on the graph (i.e., their values at a vertex are equal to the average of their values over all neighbors of ) with identical boundary values (here the boundary is the pair of vertices and ) and therefore they must be equal throughout the graph; likewise, to prove (4) we use the fact that both / ( ) and are harmonic functions with the same boundary values; and finally to prove (5) one notices that the voltages and V , both being harmonic functions on the same graph with the same 0 value at , must be factors of one another, the factor being .
Now we can prove our first main result.

Theorem 2. Let be a connected graph. For any , ∈ we have
under scenario 1.
We remark that the term in (7) can be expressed as a voltage; indeed = . These expressions of the hitting times in terms of voltages (6) and (7), though immediate as they are from Doyle and Snell's results, have not been explicitly used in the literature, and we think they lead to new insights and more elementary proofs of most results involving hitting times. Let us begin stressing that, in scenario 2, since the voltage drops from its maximum value = to its minimum value = 0 through the network , from (6) we can write Perhaps the strength of this seemingly innocent inequality can be seen as follows.

Corollary 3. For SRW on and , ∈ we have
where ( ) is the degree of the vertex and ( , ) is the distance in the graph between and . In particular, if ∼ one has Proof. We get (10) directly from (9) and we also get the fact that if there is a path of length ( , ) ≤ −1 from to , then is bounded by the effective resistance of the path, by the monotonicity law (see [1, page 67]).

The bound (11) is presented as a new result in Xu and
Yau [4], and it is attained when is a leaf of any tree and is its neighbor. The middle bound in (10) can be seen, thus a generalization of that result; also, (10) implies immediately that for any , ∈ = ( 3 ) and that if ( ) ≤ for all then = ( 2 ). In case is -regular, that is, ( ) = for all , then (10) yields It is well known (e.g., see [5]) that ( , ) ≤ 3 / , and this inequality inserted into (12) shows that hitting times in regular graphs are at most quadratic. The next result, found in Xu and Yau [4], also has a simple electric proof. Proof. The unit current that exits at comes from its − 1 neighbors; therefore Notice that in the previous corollary we have ( , ) = 1 for all ̸ = . Its proof inspires the following generalization: let = max ∈ { ( , )} and let = { ∈ : ( , ) = }, 1 ≤ ≤ , with ∈ .
It is plain to see by induction that for ≥ ≥ 2 we have and so The bound (14) is attained on the 2 + 1-cycle, when we pick and so that ( , ) = . Then = ( + 1). For our next application, let us consider now the (possibly infinite) linear graph on the integers with conductances −1, for −∞ ≤ ≤ ∞. We can prove the following corollary.

Corollary 6. In the linear graph one has
Proof. We use (6) and notice that all vertices to the left of −1 share the same voltage −1 = −1, = 1/ −1, , whereas all the vertices to the right of share the same voltage = 0.
The corollary just proved dispatches all hitting times of birth-and-death Markov chains, as discussed in Palacios and Tetali [6], where the lengthier proof uses Tetali's formula. The following is an interesting application of this corollary to a family of trees that generalizes -ary trees.

Corollary 7.
Let be a tree such that every node at distance from the root has exactly descendants, for 0 ≤ ≤ − 1, so that there are ∏ −1 =0 leaves at distance from the root. Then the expected time for the simple random walk started at the root to reach the leaves is Proof. By symmetry, all vertices at the same distance from the origin share the same voltage and thus can be shorted. We get thus a (finite) linear graph whose th vertex is the shorting of all vertices of the tree at distance from the root. In that linear graph = 0 ⋅ ⋅ ⋅ , and we apply (20). The inequality is immediate because the s are increasing.
The bound 2 above is a particular case of the general bound (1/4) 2 , shown by Pearce [7], for the hitting time of the leaves of a tree with diameter .
Now we look at SRW on graphs with cutpoints. We say that is a cutpoint of if deleting and its incident edges renders the resulting subgraph a disconnected graph. Take , ∈ and let = ( , ) and = ( , ) be the subgraphs of thus obtained: split the vertex in two, obtaining two separate connected graphs and , where the former contains and . Then we have the following corollary.

Corollary 8. With the notation of the preceding paragraph one has
where is the hitting time of the random walk restricted to the subgraph .
In particular, if is the cutpoint then 4

Journal of Probability
Proof. All vertices in share the same voltage V because there is no circulation of current in when we place a battery between and . Therefore The second summand of (24) is clearly .
Notice that (22) and (23) reduce the computation of in the original graph to that of in the subgraph . A useful particular case of the preceding corollary applies to the case of a cut-edge, whose removal renders the graph disconnected. Then we have the following corollary.

Corollary 9. Suppose that ( , ) ∈ is a cut edge of and that = ( , ) is the connected subgraph of − ( , ) that contains . Then one has
Proof. Use (23) with the cutpoint, and notice that in this case = 1 and = 1.
Now we can give a compact expression for the expected hitting times on trees, with a compact proof perhaps simpler than the ones given by Haiyan and Fuji [8] and Palacios [9]. Corollary 10. Let be a tree. For any , ∈ , and the unique path between and , one has where ( , ) is the distance from to .
Proof. In a tree every edge is a cut edge, so we apply (25) and the fact that if = { = 1 , 2 , . . . ,

An Example of Exact Calculations
We consider now the necklace graph, an example of a 3regular graph with dimension 1 which is useful for providing extreme parameters of random walks on graphs (see [5]). All the "beads" of the necklace are identical except for the two extreme beads, as seen in Figure 1. We will compute 1 8 assuming there are beads to the left of the bead containing 1 and beads to the right of the bead containing 8, and ≥ ≥ 1. For that purpose we place a battery between vertices 1 and 8 so that V 1 = 1 and V 8 = 0; that is, we work under scenario 2. It is rather simple to find 18 = 9/4 and the other voltages: 18 , It is worth remarking that, in this graph, as in other symmetric graphs, there is a kind of Noetherian principle, whereby symmetry implies conservation, namely, conservation of the sum of voltages at symmetric vertices: An application of (7), bearing in mind the conservation principle just mentioned, yields a simple computation: It is not entirely clear how the computation of 1 8 with formula (2) could have given such a closed form.

Tetali's Formula
In this section we prove Tetali's result (2) using only the superposition principle for electric networks (stating that the voltage of a node due to the presence of several batteries equals the sum of all voltages due to each individual battery) and the voltage expression of hitting times (6).
We will show that the reciprocity principle, used in Tetali's original proof, in fact follows as a corollary of the superposition principle, and we will obtain also as corollaries the triangular inequality for effective resistances and the reversibility of the sum of hitting times around a tour, in a formula that generalizes (1). All these results are known, but their proofs are more involved than the ones given here in the following theorem.
Theorem 11. For any , , ∈ , Proof. Install three batteries: one between and so that a unit current enters and exits through , and the voltages generated are 1 ( ), for ∈ , with 1 ( ) = 0. Then another between and so that a unit current enters and exits at , and the voltages generated are 2 ( ), for ∈ , with 2 ( ) = 0. Also another between and so that a unit current enters and exits at , and the voltages generated are 3 ( ), for ∈ , with 3 ( ) = 0.
Since there is no net flow of current through the network, the voltage at every node due to the superposition of the three batteries is the same: 1 ( )+ 2 ( )+ 3 ( ) = , and therefore, using (6) we have Now if we reverse the polarity of the three batteries and call the respective voltages thus generated 1 ( ), 2 ( ), 3 ( ), then we have But = because as a circuit, is receiving the same input from the original batteries and the reversed ones: three unit currents entering at , and and three unit currents exiting at the same sites. So the first equality in (30) is proven, and we only need to identify the value of the constant .
It is clear that Also, if we look at the batteries with their polarities reversed we have Now from (35) and (36) we get But if we look at battery 1 with both the original and the reverse polarities we have that Now (37) and (38) imply that Inserting (39) into (35) finishes the proof of (30).
Since the voltage is a nonnegative quantity, (39) proves (31). Also, using the voltage form of the hitting time (6) and letting run in (39) over all values ∈ proves (32).
It is plain to see that in the proof of the above theorem we have only used the superposition principle for electric networks. With the arguments in our proof we can in fact prove the reciprocity principle that was used in Tetali's original proof of his result (32).
Corollary 12. For any , , ∈ , if one sets a battery between and so that a unit current enters and exits at and the voltage at is 0, then the value of the voltage at is the same as the value of the voltage at when one disconnects the battery cable at and reconnects it at .
Proof. Translating the words into formulas, we want to show that but this is clear because both these voltages are equal to as can be seen from (39) and the facts that which is again (39) with the roles of batteries 1 and 2 exchanged.
Remarks. The argument in the proof of Theorem 11, beside being a most compact way to prove Tetali's formula, yields itself to an obvious generalization of (30) when we choose not just a triangle, but a tour of vertices 1 , 2 , . . . , = 1 in the graph. The quantity in the right hand side of (39) is identified by Tetali [10] as the ( , ) entry of a matrix that is the inverse of a matrix of conductances, but it is not identified as a voltage due to the superposition of three batteries, as we do here. Perhaps the connection merits a second look.