Consider the random walk amongN places with N(N- 1)/2 transports. We attach an exponential random variableXij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with pro More
Consider the random walk amongN places with N(N- 1)/2 transports. We attach an exponential random variableXij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probabilityp and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point logN as Np is large.
Manuscript profile