EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
From MaRDI portal
Publication:4736299
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
Cites work
- scientific article; zbMATH DE number 3794378 (Why is no real title available?)
- Fractal and lacunary stochastic processes
- Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
- Random walks on a fractal solid
- Random walks on lattices. II
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)
