The average trapping time with non-nearest-neighbor jumps on the level-3 Sierpinski gasket
From MaRDI portal
Publication:5062371
Recommendations
- The average trapping time on a half Sierpinski gasket
- RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
- Average weighted trapping time of the node- and edge-weighted fractal networks
- Mean time to absorption on the joint Sierpinski gasket
Cites work
- A guide to first-passage processes
- Average weighted trapping time of the node- and edge-weighted fractal networks
- Dynamics of continuous-time quantum walks in restricted geometries
- Effect of trap position on the efficiency of trapping in treelike scale-free networks
- Exact calculations of first-passage properties on the pseudofractal scale-free web
- scientific article; zbMATH DE number 5983847 (Why is no real title available?)
- scientific article; zbMATH DE number 5321044 (Why is no real title available?)
- Incompatibility networks as models of scale-free small-world graphs
- Probability: A Graduate Course
- Random walks on lattices. II
- Scaling laws for diffusion on (trans)fractal scale-free networks
- Spanning trees on the Sierpinski gasket
- The Laplacian on the level 3 Sierpinski gasket via the method of averages
- Towards the epidemiological modeling of computer viruses
Cited in
(4)- The average trapping time on a half Sierpinski gasket
- Mean time to absorption on the joint Sierpinski gasket
- AVERAGE TRAPPING TIME ON THE 3-DIMENSIONAL 3-LEVEL SIERPINSKI GASKET NETWORK WITH A SET OF TRAP NODES
- Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures
This page was built for publication: The average trapping time with non-nearest-neighbor jumps on the level-3 Sierpinski gasket
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5062371)