EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER

DOI10.1142/S0218127402006138zbMath1043.60038OpenAlexW1999035216MaRDI QIDQ4736299

No author found.

Publication date: 9 August 2004

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218127402006138

zbMATH Keywords

random walksfractalsSierpiński gasket

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Fractals (28A80)

Related Items (9)

A discrete random walk on the hypercube ⋮ Uncovering the impact of delay phenomenon on random walks in a family of weighted m-triangulation networks ⋮ Random walks on non-homogenous weighted Koch networks ⋮ Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks ⋮ Random walks on dual Sierpinski gaskets ⋮ Dimer coverings on the Sierpinski gasket ⋮ Controlling the trapping efficiency in a family of scale-free tree networks ⋮ Impact of degree heterogeneity on the behavior of trapping in Koch networks ⋮ ACYCLIC ORIENTATIONS ON THE SIERPINSKI GASKET

Cites Work

• Unnamed Item
• Fractal and lacunary stochastic processes
• Random Walks on Lattices. II
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
• Random walks on a fractal solid

This page was built for publication: EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER