We study the solution *V* of the Poisson equation *LV* + *f* = 0 where *L* is the backward generator of an irreducible (finite) Markov jump process and *f* is a given centered state function. Bounds on *V* are obtained using a graphical representation derived from the Matrix Forest Theorem and using a relation with mean first-passage times. Applications include estimating time-accumulated differences during relaxation toward a steady nonequilibrium regime. That includes obtaining bounds for the quasipotential which controls the thermal response.

## I. INTRODUCTION

A fascinating part of mathematical physics concerns the connection between certain (partial) differential equations and stochastic processes.^{1} Famous examples include the heat equation which is associated to Brownian motion, and the telegraph equation which connects with run-and-tumble dynamics. As a general technique, Feynman–Kac formulas provide a relation between the (semi)group kernel generated by a (quantum) Hamiltonian and a stochastic representation, aka path-integral, allowing perturbative analysis and diagrammatic developments. Summing over walks or paths and their higher-dimensional versions is indeed a typical subject of stochastic geometry. The associated *arborification*, *i.e.*, the possible restriction of those sums to (spanning sets of) trees is often a major simplification. That is the subject of the Matrix Tree and Matrix Forest Theorems, which, while mainly in linear algebra, has things to offer in stochastic analysis as well. That is also a main theme of the present paper, viz., to give a graphical representation in terms of trees of the solution of Poisson equations in the context of Markov jump processes. For the physics part, we are mostly interested in the so called quasipotential, which is related to thermal response and is crucial for the concept of nonequilibrium heat capacity.

A second and related subject is to connect solutions of the Poisson equation with mean first-passage times. The study of first-passage times comes with a useful intuition, and their behavior is obviously strongly tied to graph properties.^{2} In the end, that connection with mean first-passage times combined with graphical representations allows to give estimates on the solution of the Poisson equation. We refer to Refs. 3–5 for the case of diffusions. Such bounds are relevant for a number of applications, including the low-temperature properties of excess heat and of relaxational behavior, and all that within the context of finite Markov jump processes. In that respect, we emphasize that the techniques of the present paper apply outside the traditional context of reversibility, and indeed are motivated by problems in nonequilibrium statistical mechanics. A related and interesting subject concerns the study of metastability for out-of-equilibirum reference processes. We are not discussing here that angle, but refer to Refs. 6–8 for publications on potential theory for Markov processes. *E.g.*, the Poisson equation is used in Ref. 9 to derive the metastability of Markov processes.

In Sec. II, the setup within the framework of the Markov jump process is introduced.

The Poisson equation is presented, in various forms, in Sec. III, where we focus on relations between different concepts relating quasipotentials with mean first-passage times.

In Sec. IV, we give the graphical representation of solutions of the various Poisson equations. The main graphical representations are formulated as Theorems IV.2 and IV.3.

Section V is an application of these relations and graphical representations. It gives bounds on the solutions of the Poisson equation. We mention there an application for nonequilibrium thermal physics when the Markov jump process depends on parameters such as the inverse temperature. We have three main estimates presented in inequalities (5.3), (5.6), and (5.9).

The Appendix presents the broader context of the graphical representations and in particular Appendix B enters into more mathematical details related to the Matrix Forest Theorem.

## II. SETUP

Given a finite set *K* of states *x*, *y*, *z*, … ∈ *K*, we consider a Markov jump process *X*_{t} ∈ *K* with transition rates *k*(*x*, *y*), *x* ≠ *y*, for the jump *x* → *y*. We speak about *X*_{t} as the position of a random walker at time *t* ≥ 0, but obviously, from a physics perspective, the states *x* ∈ *K* do not need to model positions but can correspond to many-body configurations.

*x*,

*y*) of vertices

*x*,

*y*∈

*V*for which

*k*(

*x*,

*y*) > 0. We assume that the resulting graph

*G*is irreducible (strongly connected). The latter implies the exponentially fast convergence, for time

*t*↑ ∞,

*h*on

*K*and independent of the initial condition

*x*, toward the stationary expectation

*ρ*

^{s}> 0, and with

*L*the backward generator having matrix elements

*e*

^{L}

^{t},

*t*≥ 0, with

## III. POISSON EQUATION

*Poisson equation*(in the above setup) we mean in general an equation for a real-valued function

*U*on

*K*, solving

*H*⊂

*K*and given functions $f:H\u2192R,g:K\H\u2192R$.

Note that if *H* = *K*, then an extra condition is needed for the function *f*: it must be centered, ⟨*f*⟩^{s} = 0, meaning that its stationary average vanishes, because ⟨*LU*⟩^{s} = 0 always. For certain purposes, it therefore appears useful to replace the Poisson equation by the related but better-behaved resolvent equation; see Ref. 10 for an application in metastability, while we do not aim for that goal here.

### A. Quasipotential

*H*=

*K*, where we deal with the Poisson equation

*V*instead of

*U*, and we call

*V*the quasipotential with given source

*f*, where we must require ⟨

*f*⟩

^{s}=

*f*

^{s}= 0 to have a solution. The solution to (3.2) is unique up to an additive constant. If we require that ⟨

*V*⟩

^{s}= 0, then, clearly,

*f*=

*h*− ⟨

*h*⟩

^{s}.

In the case where *f* = *LE* for some potential function *E*, we have *V* = *E* − ⟨*E*⟩^{s}, which is one reason to call, more generally, the solution (3.4) *V* of (3.2) a quasipotential. Obviously, the physical interpretation of *V* in (3.4) strongly depends on the meaning of *h*. In the case where *h*(*x*) is the expected instantaneous heat flux when the state is *x*, the quasipotential is closely related to the so-called excess heat; see Refs. 11 and 12.

### B. Stopped accumulation

*H*, we introduce the random escape time

*The function*

*V*

_{H}

*is the unique solution of the Poisson equation*

*H*:

*L*

_{H}. That process is not ergodic and its (in general nonunique) stationary distributions have support in

*K*\

*H*≠ ∅. We have

*L*

_{H}(which is real by the Perron–Frobenius theorem) is strictly negative, and hence

*T*

_{H}has exponentially tight distribution, $P(TH>t)\u2264e\u2212ct$ for some

*c*> 0 and

*t*large enough, uniformly with respect to the initial condition. It means that any distribution in

*H*will vanish in the limit

*t*↑ ∞. As a result, the function

*f*

_{H}(

*x*) =

*f*(

*x*)1

_{H}(

*x*) (where 1

_{H}is the indicator for the set

*H*) can be integrated to obtain (3.5):

### C. First-passage times

*f*= 1 in the above (3.5), to introduce the mean escape time $SH(x)$ from

*H*when started from

*x*:

*x*∉

*H*we have

*H*when starting from (inner boundary) states in

*H*, with the expected stationary number of jumps to

*H*from outside (outer boundary).

*z*∈

*K*and take

*H*=

*K*\{

*z*}. We put $\tau (x,z)\u2254SH(x)$ and then from (3.11),

*mean first-passage*time to reach

*z*when started from some

*x*∈

*K*.

There is a useful relation between the quasipotential, solution of the Poisson equation (3.2), and the mean first-passage times:

*where the additive constant is fixed, if needed, by the condition*⟨

*V*⟩

^{s}= 0.

*V*in (3.15) is satisfying the Poisson equation (3.2). Keep

*H*=

*K*\{

*z*}; the identity (3.13) reads

*x*∈

*K*, which means that the

*τ*(

*x*,

*z*)’s of (3.14) play the role of Green functions for the Poisson equation. In particular, since always

*f*(

*x*) =

*∑*

_{z}

*ρ*

^{s}(

*z*)

*f*(

*z*)

*g*

_{z}(

*x*), we obtain (3.15) from the following calculation:

## IV. GRAPHICAL REPRESENTATIONS

We next turn to a graphical representation of the solution of the Poisson equations (3.1)–(3.14). To be self-consistent and as a natural introduction to the Matrix Forest Theorem, if only for notation, we still remind the reader of the Kirchhoff formula; see Refs. 15 and 16 for more explanations and examples.

### A. Kirchhoff formula

Remember that the Markov jump process, via its transition rates, has defined a digraph $G(V(G),E(G))$.

*H* is a *subgraph* of *G* if $V(H)\u2286V(G)$ and $E(H)\u2286E(G)$. The subgraph is *spanning* if $V(H)=V(G)$.

A *tree* in *G* is defined as a connected subgraph of *G* that does not contain any cycles or loops. The set of all spanning trees rooted in *x* is denoted by $Tx$.

*The following Kirchhoff formula gives the unique solution to the stationary master equation*

*ρ*

^{s}

*L*= 0

*in terms of spanning trees:*

*with weights*

*where*$Tx$

*is the set of all spanning trees rooted on*

*x*

*, and*$Tx\u2208Tx$

*is a rooted spanning tree with arcs*(

*u*,

*u*′)

*(directed*

*edges).*

The usual proof of the Kirchhoff formula (4.1) proceeds via verification. In Appendix A we add the heuristics of a more constructive proof.^{17}

### B. Graphical representation of the solution of the Poisson equation

A (spanning) *forest* in graph *G* is a set of trees. For the moment we are only concerned with two-trees, i.e., forests that consist of exactly two trees with the understanding that a single vertex also counts as one tree.

*x*and

*y*are in the same tree rooted at

*y*. The second tree is rooted as well, and we include all possible orientations. The two-trees, elements of $Fx\u2192y$, are denoted by

*F*

^{x→y}. The weight of the set

*x*and

*y*are located in different trees and

*y*is a root; see Fig. 1 where $Fx,y=Fy\Fx\u2192y$.

Recall the Poisson equation (3.2) for the quasipotential *V*, where *f* is a centered function on *K*.

*The unique solution to (3.2) with*⟨

*f*⟩

^{s}= 0

*for*⟨

*V*⟩

^{s}= 0

*is*

We proceed with the proof by direct verification. An alternative proof, starting from a more general setup and using the Matrix Forest Theorem, is presented in Appendix B.

*x*and

*y*are located in the same tree. Here, to emphasize the positions

*x*and

*y*, we use the notation $Fx,y\u2192z$ to denote the set of all forests where

*y*is located in the tree rooted in

*z*, and

*x*is in the other tree. Then,

*z*≠

*x*, take a forest $Fx,y\u2192z\u2208Fx,y\u2192z$ and add the edge (

*x*,

*y*) to that forest: one tree is rooted in

*z*, and corresponding to the root of the second tree there are two cases. Consider the case that

*x*is not the root, then there exists an edge (

*x*,

*y*′) on the tree. Remove the edge (

*x*,

*y*′) from the graph (

*x*,

*y*) ∪

*F*

^{x,y→z}, a new forest is made. The new forest is in the set

*F*

^{y}′

^{,x→z}; see Fig. 2.

The same scenario is true for the set $Fy,x\u2192z$, see Fig. 3.

Hence, when *x* is not the root, (4.4) equals zero.

Consider a forest from $Fx,y\u2192z$. If *x* is the root of its tree, then adding the edge (*x*, *y*) connects two trees and the new graph is a spanning tree rooted in *z*; see Fig. 4.

Put *z* = *x*, the set of $Fx,y\u2192x$ is empty. Take a forest from the set $Fy,x\u2192x$. Adding the edge (*x*, *y*) to the forest *F*^{y,x→x} again is a new spanning tree rooted on a vertex *r* ≠ *x*.

*f*is centered.□

Next, recall the Poisson equation (3.14) for the mean first-passage times. There as well, we get a graphical representation. The set $Fx,y$ contains all two-trees with the restrictions:

vertices

*x*and*y*are in separate trees;the tree that contains

*y*is rooted in*y*, while the second tree is rooted anywhere (containing*x*);- the weight $w(x,y)=w(Fx,y)$ of the set of such two-trees
*F*^{x,y}is$w(x,y)=\u2211Fx,y\u2208Fx,y\u220f(u,u\u2032)\u2208Fx,yk(u,u\u2032).$

We again give the Proof of Theorem IV.3 by verification.

*x*and

*y*are located in the same tree. We only consider the sets of forests where

*x*and

*y*are in different trees,

*x*and

*z*are in the different trees and

*y*is in the same tree with

*z*.

Take a forest *F*^{x,y→z} from the set $Fx,y\u2192z$. We consider two cases based on whether *x* is a root or not. If *x* is not the root in forest *F*^{x,y→z}, then *x* has a neighbor such as *y*′. Add the edge (*x*, *y*) where *y* is located in the same tree as *z*: a directed graphical object is created; see Fig. 2(a). The new graphical object is created also by adding edge (*x*, *y*′) to a forest from the set $Fy\u2032,x\u2192z$, where *x* and *z* are located in the same tree in the forest and *y*′ is in another tree; see Fig. 2(b). The same graphical objects have equal weights.

If *x* is a root, adding the edge (*x*, *y*) connects two trees and creates a new spanning tree rooted at *z*; see Fig. 4. Consider a spanning tree rooted at vertex *z*, where each of the other vertices has an outgoing edge. Remove the edge that goes out from *x*: a forest in the set $Fx,z$ is created. That ends the proof.□

*Independently of*

*x*

*,*

*where*

*W*

_{2}

*is the total weight of all spanning two-tree forests with both trees subsequently oriented toward all its*

*states.*

*y*, there is a forest $Fx,y\u2208Fx,y$ where

*x*is the root and for all

*y*≠

*x*also

*y*is the root. So then

*W*

_{2}is the weight of the set of all forests with two rooted trees and it is independent of

*x*.□

It is at first not clear how to obtain properties of the solution of the Poisson equation through formulas (4.3)–(4.5). Graphical representations are indeed most useful when applied in special parameter regimes, such as for the asymptotics when temperature is very low or driving is very big. We have applied that technique before for an extended Nernst theorem in Ref. 12. We see another example in Theorem V.3 of Sec. V but future applications are expected in the theory of nonreversible metastability as those graphical representations also apply to solutions of the resolvent equation.^{10}

## V. BOUNDS

One important issue for possible applications of the Poisson equation is to get bounds on its solution. One could imagine in fact a parameterized family of Poisson equations and the issue becomes to get bounds that are uniform in that parameterization. The present section adds such bounds, as a consequence of the previous sections.

### A. Via mean first-passage times

*V*of the Poisson equation (3.2), with ‖

*f*‖ ≔ max

_{z∈K}|

*f*(

*z*) − ⟨

*f*⟩

^{s}|. Fix any two states

*x*,

*y*∈

*K*, and put

*f*− ⟨

*f*⟩

^{s}.

*We have*

*and the bound*

*V*(

*x*) to (3.2) can be written by fixing state

*y*, and decomposing as

*T*

_{K\{y}}. As before, $SK\{y}(x)=\tau (x,y)$ is the mean first-passage time to reach

*y*from

*x*, and

*V*

_{K\{y}}(

*x*) ≕

*v*(

*x*,

*y*) is the expected accumulation for

*f*up to the first passage at

*y*, as in Sec. III B. Therefore, we have the relation

*V*⟩

^{s}= 0, there are always states

*x*

_{0},

*x*

_{1}∈

*K*with

*V*(

*x*

_{0}) ≤ 0 ≤

*V*(

*x*

_{1}). Therefore, for every

*x*∈

*K*,

*K*connecting

*x*

_{0}and

*x*. Similarly,

*V*follow from bounds on the differences, as provided in (5.3).

The bound (5.3) is not always optimal. It still can be improved as follows.

*Suppose there exists a set*$D$

*so that*

*f*(

*x*) =

*LE*(

*x*) +

*h*(

*x*)

*where*

*h*=

*h*

_{E}

*depends on*

*E*

*and*

*h*(

*x*) = 0

*for*$x\u2209D$

*. Then, the solution of the Poisson equation (3.2)*

*V*

*satisfies*

That bound requires to control the accessibility of the set $D$ only. In fact, since there is a freedom in choosing (*E*, *h*), that can be used to optimize the bound (5.6).

We observe that in the case where *f* ≡ *LE*, the bound is optimal because then *V* = *E* + *constant*.

### B. Via graphical representation

*n*vertices is obtained from a Markov jump process with transition rates

*k*(

*u*,

*u*′). We define

*For all*

*x*

*,*

We apply (4.3) of Theorem IV.2. The product over the weights over edges is obviously bounded, and the weight of any forest in the graph is bounded as well. In other words, for any *x* and *y* in the graph, *w*(*x* → *y*) is bounded.

As an application of (5.9), we can suppose that the rates *k*(*x*, *y*) = *k*_{λ}(*x*, *y*) depend on a real-valued parameter *λ*. For simplicity, we consider the limit *λ* → ∞ (taking for *λ* the inverse temperature is a relevant example from statistical mechanics). Observe that there is a general lower bound on *W*, i.e., *W* ≥ max_{T,x} *w*(*T*_{x}), the largest weight of all spanning trees. Hence, if there exists a spanning tree with *w*(*T*_{x}) > 0 uniformly in *λ*, then *W* = *W*_{λ} > 0 is uniformly bounded, and (5.9) gives a uniform bound on *V*.

The bound (5.9) can for instance be used in an argument extending the Third Law of Thermodynamics to nonequilibrium systems; see Ref. 11 where the source function *f* is the expected heat flux. The quasipotential *V* in (3.4) is then the time-integral of the difference between the instantaneous heat flux and the stationary heat flux.

## VI. CONCLUSIONS

The Poisson equation is ubiquitous in mathematical physics. We have considered a setup where the linear operator is the backward generator of a Markov jump process and the functions are defined on the possible (finite number of) states. We have related the solution of that discrete Poisson equation to the formalism of mean first-passage times, and we have given graphical representations that allow precise estimates—both for the accumulations before first hitting a particular state when starting from another one, and for the quasipotentials measuring the accumulated excess during relaxation to stationarity. The results do not assume reversibility, and are ready to be used in extensions of potential theory when applied to problems in steady-nonequilibrium statistical mechanics. Obvious targets are reaction rate theory for driven or active systems, and metastability around *non*equilibrium steady conditions where we expect that graphical representations are particularly helpful in low ambient-temperature or high-driving regimes.

## AUTHOR DECLARATIONS

### Conflict of Interest

The authors have no conflicts to disclose.

### Author Contributions

All authors contributed equally to this work.

**Faezeh Khodabandehlou**: Writing – original draft (equal). **Christian Maes**: Writing – review & editing (equal). **Karel Netočný**: Writing – original draft (equal).

## DATA AVAILABILITY

The data that support the findings of this study are available within the article.

### APPENDIX A: ON PROVING THE KIRCHHOFF FORMULA

The Kirchhoff formula can be seen as a consequence of the Matrix Tree Theorem.^{18–20} However, there also exists a more probabilistic approach. The ideas is illustrated by the algorithm in Fig. 5, where a tree $Tx\u2032$ is constructed by removing the edge (*x*, *y*′) from the tree *T*_{y}, and then adding the edge (*y*, *x*). That algorithm is used in Ref. 17 to construct a reversible Markov chain *Y*_{n} on an ensemble of trees, where the states are the rooted spanning trees and jumps are possible if and only if the corresponding trees are connected by the above-mentioned algorithm. Let *Q*_{ab} = *q*(*a*, *b*) be the stochastic matrix of *Y*_{n}, and put *π* the stationary distribution of *Q*. For example, we can assign states *a* and *b*, respectively, to the trees *T*_{y} and $Tx\u2032$ in Fig. 5, and take transition rates *q*(*a*, *b*). It is shown that putting *q*(*a*, *b*) = *k*(*y*, *x*), *q*(*b*, *a*) = *k*(*x*, *y*′) produces detailed balance *π*_{a}*q*(*a*, *b*) = *π*_{b}*q*(*b*, *a*). We add a sketch of the proof.

*y*, $Ty\u2208Ty$. Let

*x*be a vertex located on the tree

*T*

_{y}. In this case,

*x*is not the root and there exists a vertex

*y*′ (which may be equal to

*y*) and an edge (

*x*,

*y*′) which goes out from

*x*and connects

*x*to the tree. By removing the edge (

*x*,

*y*′) from the tree

*T*

_{y}and adding the edge (

*y*,

*x*), a new spanning tree rooted in

*x*is created; see Fig. 5.

*y*we can make a new spanning tree rooted in

*x*. That algorithm makes a spanning tree rooted in

*y*from a spanning tree rooted in

*x*. Therefore,

### APPENDIX B: MATRIX FOREST THEOREM

The present appendix gives the broader mathematical context of the graphical representations.

#### 1. Laplacian matrix and the backward generator

Consider a self edge-free directed graph $G(V(G),E(G))$, with *n* vertices. The *adjacency matrix* $A(G)$ is a *n* × *n* matrix with entries denoted as $A(G)xy$, representing the weight of the edge (*x*, *y*), which is denoted by *ω*(*x*, *y*).

The out-weight of a vertex $x\u2208V(G)$ is *∑*_{y}*ω*(*x*, *y*), and we define the *n* × *n* diagonal matrix $D(G)$ with *D*_{xy} = 0 if *x* ≠ *y* and otherwise *D*_{xx} = *∑*_{y}*ω*(*x*, *y*).

*Laplacian matrix*for a directed graph $G$ is

*ω*(

*x*,

*y*) =

*k*(

*x*,

*y*). Therefore, all properties of the Laplacian of a weighted digraph, also hold for the backward generator

*L*, as described in Sec. II.

The Laplacian matrix of a (directed) graph has several important properties that have been extensively studied in the literature.^{21,22}

#### 2. Pseudo-inverses of the Laplacian matrix

The Laplacian matrix is not invertible, and different pseudo/generalized-inverses can be defined, *e.g.*, group inverse, Drazin inverse, Moore–Penrose inverse and resolvent inverse.Depending on the characteristics of the graph, the various inverses of the Laplacian may or may not be equal; see also Ref. 23.

*A*, its

*Drazin inverse*is denoted by

*A*

^{D}and is the unique matrix

*X*satisfying the following equations:

*ν*= ind

*A*[remember ind

*A*is the smallest non negative integer number

*b*such that rank(

*A*

^{b+1}) = rank(

*A*

^{b})]. If

*ν*= 0, then

*A*

^{D}=

*A*

^{−1}; if

*ν*≤ 1, then

*A*

^{D}is referred to the

*group inverse*and it is denoted by

*A*

^{#}which is a unique matrix such as

*X*satisfying the following equations:

We refer to Ref. 24 for the Matrix Forest Theorem for a Laplacian matrix. We briefly recall that result.

Consider a weighted digraph $G$, where *n* is the number of vertices. *I* is the identity matrix, $Fmx\u2192y$ is the set of all forests with *m* edges such that *x* and *y* are in the same tree and *y* is always a root, $Fm$ is the union of all $Fmx$, and *m* is the number of edges making the forests. For example, if *m* = *n* − 1 the forests are made by one spanning tree with *n* − 1 edges, and when *m* = *n* − 2 the forest has two trees. $w(Fmx\u2192y)$ is the weight of the set $Fmx\u2192y$. Put *γ* as the dimension of the forest in $G$. Forest dimension is the minimum number of rooted trees that a spanning rooted forest can have in a directed graph. Note that for the underlining graph of an irreducible Markov process, *γ* = 1.

Consider a weighted digraph $G$ with the Laplacian matrix $L$. From Ref. 25,

*For any*

*α*> 0

*, the matrix*$(I+\alpha L(G))\u22121$

*has the graphical representation*

*γ*= 1,

*xy*denotes raw

*x*and column

*y*, and we have used $Fn\u22121x\u2192y=Ty$, i.e., the forest with

*n*− 1 edges is a spanning tree. $w(Ty)$ is the weight of the set $Ty$, $w(Ty)\u2254w(y)$.

*The*

*x*,

*y*

*entry of the group inverse of the Laplacian matrix is*

*γ*= 1,

*n*− 1 edges is indeed the set of all rooted spanning trees. $F$ denotes the set of all rooted spanning forests consisting of two trees. In the last line, the Kirchhoff formula is used.

*L*

^{#}and from Theorem B.2 the graphical representation is

#### 3. Another proof of Theorem IV.2

We can solve the Eq. (3.2) by utilizing a graphical representation of the pseudoinverse of *L*, which can be obtained through the application of the Matrix Forest Theorem.

*f*is centered, meaning

*∑*

_{y}

*f*(

*y*)

*ρ*

^{s}(

*y*) = 0. Use the graphical representation (B4),

*f*and the proof is finished.□

*f*give the same solution to the Poisson equation. The reason is that the index of the backward generator

*L*equals one; see Ref. 25. We check that explicitly in their graphical representations,

*f*is centered, then the resolvent inverse, Drazin inverse and group inverse of

*L*are all equal giving

*V*= −

*L*

^{−1}

*f*.

#### 4. Another proof of Theorem IV.3

The equation in (3.14) can be solved by the graphical representation of the group inverse of the backward generator.

*The solution of*

*Lτ*+ 1 = 0

*is*

*where*$1$

*is a*

*n*×

*n*

*matrix such that all elements are 1 and*$D$

*is a diagonal*

*n*×

*n*

*matrix such that*$Dxx=1\rho (x)$

*.*$Ldg#$

*is a matrix made by putting all the entries outside of the main diagonal of*

*L*

^{#}

*equal to*

*zero.*

*n*×

*n*matrix with all entries equal to zero. Furthermore,

*x*and

*z*, consider two sets $Fy\u2192z$ and $Fx\u2192z$. For the fix

*y*, the intersection of them is a set of all forests such that

*x*and

*y*are in the same tree rooted at

*z*. As the result, in (B12), we only consider the component of the set $Fy\u2192z$ where

*x*is not in the same tree with

*y*and

*z*, and in the set $Fx\u2192z$ only the components where

*z*is not in a same tree with

*x*and

*z*. Hence,

*z*is on the tree rooted in

*y*and

*x*is located on the another tree.

Take a forest from the set $Fx,y\u2192z$. If *x* is the root, then adding edge the (*x*, *y*) connects two trees such that a new spanning tree rooted in *z* is created, see Fig. 4. Now consider a spanning tree rooted at *z*, by removing the edge goes out from *x* a forest in the set $Fx,z$ is created.

*x*is not the root. If

*x*is not the root, then it has a neighbor such as

*y*′. Add the edge (

*x*,

*y*) to

*F*

^{x,y→z}, a directed graphical object is created. The new graphical object is created also by adding edge (

*x*,

*y*′) to a forest from the set $Fy\u2032,x\u2192z$, see Fig. 2. The same graphical objects have equal weights and as a result

*Lτ*= −1 for every

*z*≠

*x*, which ends the proof of (B11).

## REFERENCES

*Classical Potential Theory and Its Probabilistic Counterpart: Advanced Problems*(Springer, 1984).

*A Guide to First-Passage Processes*

*Generalized Inverses: Theory and Applications*