Abstract
Let {X v: v ∈ Z d}, d≥2, be i.i.d. positive random variables with the common distribution F which satisfy, for some a>0, ∫ x d(log+ x)d+a dF(x)<∞ Define
Then it has been shown that there exist positive finite constants M = M[F] and N = N[F] such that
Similar content being viewed by others
REFERENCES
Cox, J. T. (1980). The time constant of first-passage percolation on the square lattice. Adv. Appl. Prob. 12, 864–879.
Cox, J. T., Gandolfi, A., Griffin, Ph. S., and Kesten, H. (1993). Geedy lattice animals I: Upper bounds. Ann. Appl. Prob. 3, 1151–1169.
Durrett, R. (1991). Probability: Theory and Examples. Wadsworth.
Fontes, L., and Newman, C. M. (1993). First passage percolation for random colorings of Z d. Ann. Appl. Prob. 3, 746–762.
Gandolfi, A., and Kesten, H. (1994). Greedy lattice animals II: Linear growth. Ann. Appl. Prob. 4, 76–107.
Grimmett, G. (1989). Percolation. Springer.
Lee, S. (1993). An inequality for greedy lattice animals. Ann. Appl. Prob. 3, 1170–1188.
Smythe, R. T., and Wierman, J. C. (1978). First-passage percolation on the square lattice. Lecture Notes in Math. 671, Springer.
Sznitman, A. (1995). Crossing velocities and random lattice animals. Ann. Prob. 23, 1006–1023.
Rights and permissions
About this article
Cite this article
Lee, S. The Continuity of M and N in Greedy Lattice Animals. Journal of Theoretical Probability 10, 87–100 (1997). https://doi.org/10.1023/A:1022642314829
Issue Date:
DOI: https://doi.org/10.1023/A:1022642314829