EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
DOI10.1142/S0218127402006138zbMATH Open1043.60038OpenAlexW1999035216MaRDI QIDQ4736299FDOQ4736299
Authors:
Publication date: 9 August 2004
Published in: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218127402006138
Recommendations
- Random walks on a fractal solid
- Random walks on dual Sierpinski gaskets
- Random walk statistics on fractal structures
- Hamiltonian walks on the Sierpinski gasket
- Scaling exponents for random walks on Sierpinski carpets and number of distinct sites visited: a new algorithm for infinite fractal lattices
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Sums of independent random variables; random walks (60G50) Fractals (28A80)
Cites Work
Cited In (11)
- Hamiltonian walks on the Sierpinski gasket
- Uncovering the impact of delay phenomenon on random walks in a family of weighted \(m\)-triangulation networks
- Dimer coverings on the Sierpinski gasket
- A discrete random walk on the hypercube
- Controlling the trapping efficiency in a family of scale-free tree networks
- Random walks on non-homogenous weighted Koch networks
- Random walks on dual Sierpinski gaskets
- Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
- Exact computation and approximation of stochastic and analytic parameters of generalized Sierpinski gaskets
- Impact of degree heterogeneity on the behavior of trapping in Koch networks
- Acyclic orientations on the Sierpinski gasket
This page was built for publication: EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736299)