Hostname: page-component-8448b6f56d-tj2md Total loading time: 0 Render date: 2024-04-23T22:49:19.982Z Has data issue: false hasContentIssue false

Differentiability and monotonicity of expected passage time in Euclidean first-passage percolation

Published online by Cambridge University Press:  14 July 2016

C. Douglas Howard*
Affiliation:
Baruch College, The City University of New York
*
Postal address: Baruch College, The City University of New York, Mathematics Department, 17 Lexington Avenue, New York, NY 10010, USA. Email address: dhoward@baruch.cuny.edu

Abstract

In first-passage percolation (FPP) models, the passage time T from the origin to the point e satisfies f() := ET = μ + o(½+ε), where μ ∊ (0,∞) denotes the time constant. Yet, for lattice FPP, it is not known rigorously that f() is eventually monotonically increasing. Here, for the Poisson-based Euclidean FPP of Howard and Newman (Prob. Theory Relat. Fields108 (1997), 153–170), we prove an explicit formula for f′(). In all dimensions, for certain values of the model's only parameter we have f′() ≥ C > 0 for large .

Type
Research Papers
Copyright
Copyright © by the Applied Probability Trust 2001 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Research supported in part by NSF Grant DMS-98-15226 and a Eugene Lang Research Fellowship.

References

Alexander, K. S. (1993). A note on some rates of convergence in first-passage percolation. Ann. Appl. Prob. 3, 8190.Google Scholar
Alm, S. E. (1998). A note on a problem by Welsh in first-passage percolation. Combin. Prob. Comput. 7, 1115.Google Scholar
Alm, S. E., and Wierman, J. C. (1999). Inequalities for means of restricted first-passage times in percolation theory. Combin. Prob. Comput. 8, 307315.Google Scholar
Hammersley, J. M., and Welsh, D. J. A. (1965). First-passage percolation, subadditive processes, stochastic networks and generalized renewal theory. In Bernoulli, Bayes, Laplace Anniversary Volume, eds Neyman, J. and LeCam, L., Springer, Berlin, pp. 61110.Google Scholar
Howard, C. D., and Newman, C. M. (1997). Euclidean models of first-passage percolation. Prob. Theory Relat. Fields 108, 153170.Google Scholar
Howard, C. D., and Newman, C. M. (1999). From greedy lattice animals to Euclidean first-passage percolation. In Perplexing Problems in Probability, eds Bramson, M. and Durrett, R., Birkhäuser, Boston, pp. 107119.Google Scholar
Howard, C. D., and Newman, C. M. (2001). Geodesics and spanning trees for Euclidean first-passage percolation. Ann. Prob. 29, 577623.Google Scholar
Kesten, H. (1993). On the speed of convergence in first-passage percolation. Ann. Appl. Prob. 3, 296338.Google Scholar
Rudin, W. (1976). Principles of Mathematical Analysis, 3rd edn. McGraw-Hill, New York.Google Scholar
Serafini, H. C. (1997). First-passage percolation in the Delaunay graph of a d-dimensional Poisson process. Doctoral Thesis, Courant Institute of Mathematical Sciences, New York University.Google Scholar
Vahidi-Asl, M. Q., and Wierman, J. C. (1990). First-passage percolation on the Voronoi tessellation and Delaunay triangulation. In Random Graphs '87, eds Karońske, M., Jaworski, J. and Ruciński, A., John Wiley, New York, pp. 341359.Google Scholar
Vahidi-Asl, M. Q., and Wierman, J. C. (1992). A shape result for first-passage percolation on the Voronoi tessellation and Delaunay triangulation. In Random Graphs '89, eds Frieze, A. and Luczak, T., John Wiley, New York, pp. 247262.Google Scholar