Cited By
View all- Franz ASchulzky CNgoc Anh3 DSeeger SBalg JHoffmann K(2006)Random Walks on FractalsParallel Algorithms and Cluster Computing10.1007/3-540-33541-2_17(303-313)Online publication date: 2006
Using computer algebra methods to determine the chemical dimension of finitely ramified Sierpinski carpets
Abstract
We present a new algorithm for calculating the chemical dimension d1 of finitely ramified Sierpinski carpets. Using an algorithm of Dijkstra, we compute iteratively, using Mathematica, the shortest paths through a carpet. The scaling exponent of the lengths of these shortest paths over the linear size of the carpet is dmin the minimum path dimension, which is related to the chemical dimension.
References
[1]
S. Havlin and D. Ben-Avraham. Diffusion in disordered media. Adv. Phys., 36(6):695-798, 1987.
[2]
A. Bunde and S. Havlin, editors. Fractals and Disordered Systems. Springer, 1996.
[3]
C. Schulzky, A. Franz and K. H. Hoffmann. Resistance scaling and random walk dimensions for finitely ramified Sierpinski carpets. SIGSAM Bulletin, 34(3): 1-8, 2000.
[4]
K. J. Falconer. Techniques in fractal geometry. John Wiley & Sons Ltd, Chichester, 1997.
[5]
R. Dasgupta, T. K. Ballabh and S. Tarafdar. Scaling exponents for random walks on Sierpinski carpets and number of distinct sites visited: A new algorithm for infinite fractal lattices. J. Phys. A: Math. Gen., 32(37):6503-6516, 1999.
[6]
S. Seeger, A. Franz, C. Schulzky and K. H. Hoffmann. Random walks on finitely ramified Sierpinski carpets. Comp. Phys. Comm., 134(3): 307-316, 2001.
[7]
A. Franz, C. Schulzky, S. Seeger and K. H. Hoffmann. An efficient implementation of the exact enumeration method for random walks on Sierpinski carpets. Fractals, 8(2):155-161, 2000.
[8]
Wolfram Research, Inc. Mathematica, Version 3.0. Champaign, Illinois, 1996.
[9]
M. T. Barlow, K. Hattori, T. Hattori and H. Watanabe. Restoration of isotropy on fractals. Phys. Rev. Lett., 75(17):3042-3045, 1995.
Index Terms
- Using computer algebra methods to determine the chemical dimension of finitely ramified Sierpinski carpets
Index terms have been assigned to the content through auto-classification.
Recommendations
Resistance scaling and random walk dimensions for finitely ramified Sierpinski carpets
We present a new algorithm to calculate the random walk dimension of finitely ramified Sierpinski carpets. The fractal structure is interpreted as a resistor network for which the resistance scaling exponent is calculated using Mathematica. A fractal form ...
Self-assembling rulers for approximating generalized sierpinski carpets
COCOON'11: Proceedings of the 17th annual international conference on Computing and combinatoricsDiscrete self-similar fractals have been studied as test cases for self-assembly ever since Winfree exhibited a tile assembly system in which the Sierpinski triangle self-assembles. For strict self-assembly, where tiles are not allowed to be placed ...
Shortest paths in Sierpiński graphs
In 23], Klav ar and Milutinović (1997) proved that there exist at most two different shortest paths between any two vertices in Sierpiński graphs S k n , and showed that the number of shortest paths between any fixed pair of vertices of S k n can be ...
Comments
Information & Contributors
Information
Published In
Copyright © 2002 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 June 2002
Published in SIGSAM Volume 36, Issue 2
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 192Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
Cited By
View all- Franz ASchulzky CNgoc Anh3 DSeeger SBalg JHoffmann K(2006)Random Walks on FractalsParallel Algorithms and Cluster Computing10.1007/3-540-33541-2_17(303-313)Online publication date: 2006
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in