✦ LIBER ✦

Self-avoiding walks on Sierpinski carpets

✍ Scribed by Yang-Ming Zhu; Zu-Hong Lu; Yu Wei

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 225 KB
Volume: 177
Category: Article
ISSN: 0375-9601
DOI: 10.1016/0375-9601(93)90041-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Self-avoiding walks

✍ L. Peliti 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Distinct sites visited in a random walk

Distinct sites visited in a random walk on Sierpinski carpets

✍ Ruma Dasgupta; T.K. Ballabh; S. Tarafdar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Self-avoiding walks on the simple cubic

Self-avoiding walks on the simple cubic lattice

✍ A. Bellemans 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 217 KB

On the average span of self-avoiding wal

On the average span of self-avoiding walks

✍ A. Bellemans 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 255 KB

Self-avoiding walks over adaptive unstru

Self-avoiding walks over adaptive unstructured grids

✍ Heber, Gerd; Biswas, Rupak; Gao, Guang R. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 467 KB

In this paper, we present self-avoiding walks as a novel technique to 'linearize' an unstructured mesh. Unlike space-filling curves which are based on a geometric embedding, our strategy is combinatorial since it uses the mesh connectivity only. We formulate a linear time-complexity algorithm for th

Self-avoiding walks on a pair of three d

Self-avoiding walks on a pair of three dimensional lattices

✍ J.A. Leu 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 155 KB