Page "Loop-erased random walk" Paragraph 1

Assume G is some graph and is some path of length n on G. In other words, are vertices of G such that and are neighbors.

Then the loop erasure of is a new simple path created by erasing all the loops of in chronological order.

Formally, we define indices inductively using