Hostname: page-component-89b8bd64d-rbxfs Total loading time: 0 Render date: 2026-05-06T11:30:20.020Z Has data issue: false hasContentIssue false
  • English
  • Français

General first-passage percolation

Published online by Cambridge University Press:  01 July 2016

Colin McDiarmid
Colin McDiarmid*
Affiliation:
Wolfson College, Oxford
*
∗Postal address: Institute of Economics and Statistics, St. Cross Building, Manor Road, Oxford OX1 3UL, U.K.
Get access Rights & Permissions [Opens in a new window]

Abstract

We present some general results related to first-passage percolation. These results involve families of random variables arranged in independent subfamilies. Applications are given to the study of random networks and to first-passage percolation.

Keywords

FIRST-PASSAGE PERCOLATIONCLUTTERRANDOM NETWORK

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 15 , Issue 1 , March 1983 , pp. 149 - 161
Copyright
Copyright © Applied Probability Trust 1983 

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.)

Article purchase

Temporarily unavailable

References

[1] Esary, J. D., Proschan, F. and Walkup, D. W. (1967) Association of random variables, with applications. Ann. Math. Statist. 38, 1466–1474.Google Scholar
[2] Ford, L. R. and Fulkerson, D. R. (1962) Flows in Networks. Princeton University Press, Princeton, NJ.Google Scholar
[3] Hammersley, J. M. (1961) Comparision of atom and bond percolation processes. J. Math. Phys. 2, 728–733.CrossRefGoogle Scholar
[4] Hammersley, J. M. (1980) A generalisation of McDiarmid's theorem for mixed Bernoulli percolation. Math. Proc. Camb. Phil. Soc. 88, 167–170.Google Scholar
[5] Hammersley, J. M. and Walters, R. S. (1963) Percolation and fractional branching processes. J. SIAM 11, 831–839.Google Scholar
[6] Hammersley, J. M. and Welsh, D. J. A. (1965) First passage percolation, subadditive processes, stochastic networks and generalised renewal theory. In Bernoulli-Bayes-Laplace Anniversary Volume, ed. LeCam, L. M. and Neyman, J., Springer-Verlag, Berlin, 61–110.Google Scholar
[7] Jogdeo, K. (1977) Association and probability inequalities. Ann. Statist. 5, 495–504.Google Scholar
[8] Lehmann, E. L. (1966) Some concepts of dependence. Ann. Math. Statist. 37, 1137–1153.Google Scholar
[9] McDiarmid, C. J. H. (1980) Clutter percolation and random graphs. Math. Progr. Study 13, 17–25.Google Scholar
[10] McDiarmid, C. J. H. (1981) General percolation and random graphs. Adv. Appl. Prob. 13, 40–60.Google Scholar
[11] Oxley, J. G. and Welsh, D. J. A. (1979) On some percolation results of J. M. Hammersley. J. Appl. Prob. 16, 526–540.Google Scholar
[12] Rüschendorf, L. (1982) Comparison of percolation probabilities. J. Appl. Prob. 19, 864–868.Google Scholar
[13] Smythe, R. T. and Wierman, J. C. (1978) First Passage Percolation on the Square Lattice. Lecture Notes in Mathematics 671, Springer-Verlag, Berlin.Google Scholar
[14] Welsh, D. J. A. (1977) Percolation and related topics. Sci. Prog., Oxford 64, 65–83.Google Scholar