Lower and Upper Bounds for the Time Constant of First-Passage Percolation

Authors:
Sven Erick Alm;Robert Parviainen
Affiliations:
Department of Mathematics, Uppsala University, PO Box 480, S-751 06 Uppsala, Sweden (e-mail: sea@math.uu.se);Department of Mathematics, Uppsala University, PO Box 480, S-751 06 Uppsala, Sweden (e-mail: robert@math.uu.se)
Venue:
Combinatorics, Probability and Computing
Year:
2002

Citing 0
Cited 2

First-passage percolation with exponential times on a ladder

Combinatorics, Probability and Computing
First-passage percolation on a width-2 strip and the path cost in a VCG auction

WINE'06 Proceedings of the Second international conference on Internet and Network Economics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present improved lower and upper bounds for the time constant of first-passage percolation on the square lattice. For the case of lower bounds, a new method, using the idea of a transition matrix, has been used. Numerical results for the exponential and uniform distributions are presented. A simulation study is included, which results in new estimates and improved upper confidence limits for the time constants.