Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
The average distance on the Sierpiński gasket
Download PDF
Download PDF
  • Published: March 1990

The average distance on the Sierpiński gasket

  • Andreas M. Hinz1 &
  • Andreas Schief1 

Probability Theory and Related Fields volume 87, pages 129–138 (1990)Cite this article

  • 417 Accesses

  • 45 Citations

  • 2 Altmetric

  • Metrics details

Summary

The canonical distance of points on the Sierpiński gasket is considered and its expectation deduced. The solution is surprising, both for the value and for the method derived from an analysis of graphs connected with the Tower of Hanoi problem.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. Barlow, M.T., Perkins, E.A.: Brownian motion on the Sierpinski gasket. Probab. Th. Rel. Fields79, 543–623 (1988)

    Google Scholar 

  2. Breiman, L.: Probability. Reading, Mass.: Addison-Wesley 1968

    Google Scholar 

  3. Chan, Tat-Hung: A statistical analysis of the Towers of Hanoi problem. Intern. J. Comput. Math.28, 57–65 (1989)

    Google Scholar 

  4. Er, M.C.: An analysis of the generalized Towers of Hanoi problem. BIT23, 429–435 (1983)

    Google Scholar 

  5. Hinz, A.M.: The Tower of Hanoi. Enseign. Math. (2),35, 289–321 (1989)

    Google Scholar 

  6. Lévy, P.: Sur les séries dont les termes sont des variables éventuelles indépendantes. Studia Math.3, 119–155 (1931)

    Google Scholar 

  7. Lu, Xuemiao: Towers of Hanoi graphs. Intern. J. Comput. Math.19, 23–38 (1986)

    Google Scholar 

  8. Mandelbrot, B.B.: The fractal geometry of nature. San Francisco: Freeman 1982

    Google Scholar 

  9. Scarioni, F., Speranza, H.G.: A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle. Inform. Process. Lett.18, 99–103 (1984)

    Google Scholar 

  10. Scorer, R.S., Grundy, P.M., Smith, C.A.B.: Some binary games. Math. Gaz.280, 96–103 (1944)

    Google Scholar 

  11. Sierpiński, W.: Sur une courbe dont tout point est un point de ramification. C. R. Acad. Sci. Paris160, 302–305 (1915)

    Google Scholar 

  12. Stewart, I.: Le lion, le lama et la laitue. Pour la Science142, 102–107 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität München, Theresienstrasse 39, D-8000, München 2, Federal Republic of Germany

    Andreas M. Hinz & Andreas Schief

Authors
  1. Andreas M. Hinz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Schief
    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

Hinz, A.M., Schief, A. The average distance on the Sierpiński gasket. Probab. Th. Rel. Fields 87, 129–138 (1990). https://doi.org/10.1007/BF01217750

Download citation

  • Received: 29 January 1990

  • Revised: 14 May 1990

  • Issue Date: March 1990

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

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Stochastic Process
  • Probability Theory
  • Average Distance
  • Mathematical Biology
  • Hanoi Problem
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature