This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n1 log P ( n1 S n a ) , a > 1 and n1 log P ( n1 S n a ) , a < 1. 4. Oriented rst passage percolation. Consider the lattice quadrant { ( i,j ) : i,j } with directed edges ( i,j ) ( i +1 ,j ) and ( i,j ) ( i,j +1). Associate to each edge e an exponential(1) r.v. X e , independent for dierent edges. For each directed path of length d started at (0 , 0), let S = edges e in path X e . Let H d be the minimum of S over all such paths of length d . It can be shown that d1 H d c a.s., for some constant c . Give explicit upper and lower bounds on c . [Hint: use result of previous question for lower bound.] 9...
View Full
Document
 Spring '09
 Reed

Click to edit the document details