Weighted graph
= Weighted graph
{wiki}
A weighted graph assigns a symmetric nonnegative conductance $\mu_{xy}$ to each edge. With killing weights $\kappa_x$, the associated discrete-time walk moves from $x$ to $y$ with probability $\mu_{xy}/\mu_x$ and is killed with probability $\kappa_x/\mu_x$, where $\mu_x=\kappa_x+\sum_y\mu_{xy}$.