Skip to main content
SpringerLink
Log in

On not storing the path of a random walk

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

We describe a novel form of Monte Carlo method with which to study self-avoiding random walks; we do not (in any sense) store the path of the walk being considered. As we show, the problem is related to that of devising a random-number generator which can produce itsnth number on request, without running through its sequence up to this point.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. M. Pollard,A Monte Carlo method for factorisation, BIT 15, 3 (1975), 331–335.

    Google Scholar 

  2. J. M. Pollard,Monte Carlo methods for index computation (modp), Math. Comp. 32,143 (1978), 918–924.

    Google Scholar 

  3. J. M. Hammersley and D. C. Handscomb,Monte Carlo Methods, Methuen, 1964.

  4. J. M. Hammersley,Poking about for the Vital Juices of Mathematical Research, Bull. I.M.A. 10,7/8 (1974), 235–247.

    Google Scholar 

  5. D. E. Knuth,Searching and Sorting: the Art of Computer Programming, Vol. 3, Addison-Wesley, 1973.

  6. D. E. Knuth,Seminumerical Algorithms: the Art of Computer Programming, Vol. 2, Addison-Wesley, 1969.

  7. R. P. Brent,Analysis of some cycle finding and factorisation algorithms (to be published).

Download references

Author information

Authors and Affiliations

  1. Tidmarsh Cottage, Manor Farm Lane, Tidmarsh, Pangbourne, RG8 8EX, Berkshire, England

    J. M. Pollard

Authors
  1. J. M. Pollard
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pollard, J.M. On not storing the path of a random walk. BIT 19, 545–548 (1979). https://doi.org/10.1007/BF01931273

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01931273

Keywords

Search

Navigation