Skip to main content

First-Passage Percolation, Subadditive Processes, Stochastic Networks, and Generalized Renewal Theory

  • Chapter

Abstract

Origins of first passage percolation problems. In 1957, Broadbent and Hammersley gave a mathematical formulation of percolation theory. Since then much work has been done in this field and has now led to first-passage percolation problems. In the following two examples we contrast the early formulation with its more recent developments.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bigelow, C. G.: Bibliography on project planning and control by network analysis 1959–61. Op. Res. 10, 728 (1962).

    Article  MATH  Google Scholar 

  • DooB, J. L.: Stochastic Processes. New York: Wiley 1952.

    Google Scholar 

  • Erdös, P.: Remark on my paper “On a theorem of Hsu and Robbins” Ann. Math. Statist. 21, 138 (1950).

    Article  MATH  Google Scholar 

  • Feller, W.: An introduction to probability theory and its applications. New York: Wiley 1957.

    MATH  Google Scholar 

  • Frisch, H. L., and J. M. Hammersley: Percolation processes and related topics. J. Soc. Indust. Appl. Math. 11, 894 (1963).

    Article  MathSciNet  Google Scholar 

  • Fulkerson, D. R.: Expected critical path lengths in PERT networks. Op. Res. 10, 808 (1962).

    Article  MATH  Google Scholar 

  • Hammersley, J. M.: Generalization of the fundamental theorem on subadditive functions. Proc. Cambridge Phil. Soc. 58, 235 (1962).

    MathSciNet  MATH  Google Scholar 

  • Hille, E.: Functional Analysis and Semigroups. Amer. Math. Soc. Colloq. Publ. 1957, 31.

    Google Scholar 

  • Kochen, M., C. Abraham, and E. Wong: Adaptive man-machine concept-proces-sing. Air Force Cambridge Research Laboratories Report No. 397 (1962).

    Google Scholar 

  • Malcolm, D. G., J. H. Roseboom, E. E. Clark, and W. Fazar: Application of a technique for research and development program evaluation. Op. Res. 7, 646 (1959).

    Article  Google Scholar 

  • Pollack, M.: Solutions of the kth best route through a network — a review. To appear in J.Math. Anal and Appl.

    Google Scholar 

  • Pollack, M., and W. Wiebenson: Solutions of the shortest route problem — a review. Op. Res. 8, 224 (1960).

    Article  MathSciNet  MATH  Google Scholar 

  • Smith, W. L.: Renewal theory and its ramifications. J. Roy. Statist. Soc. B. 20, 243 (1958).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jerzy Neyman Lucien M. Le Cam

Rights and permissions

Reprints and permissions

Copyright information

© 1965 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hammersley, J.M., Welsh, D.J.A. (1965). First-Passage Percolation, Subadditive Processes, Stochastic Networks, and Generalized Renewal Theory. In: Neyman, J., Le Cam, L.M. (eds) Bernoulli 1713, Bayes 1763, Laplace 1813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-49749-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-49749-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-49466-6

  • Online ISBN: 978-3-642-49749-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics