Finite-size scaling behavior of biased SAW at the percolation threshold

An algorithm determining the most likely trajectories on a percolation cluster of a random walker subject to a constant field has been constructed. The resulting trajectories are represented by self-avoiding walks for which the average time spent at a percolation incipient cluster obeys finite-size scaling behavior.