The mean time to absorption on horizontal partitioned Sierpinski gasket networks
From MaRDI portal
Publication:6653973
DOI10.4208/ATA.OA-2021-0014MaRDI QIDQ6653973FDOQ6653973
Authors: Zhizhuo Zhang, Bo Wu, Zu-Guo Yu 
Publication date: 18 December 2024
Published in: Analysis in Theory and Applications (Search for Journal in Brave)
Recommendations
- Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures
- 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
- Expanded Koch networks: structure and trapping time of random walks
- RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76) Random walks on graphs (05C81) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Statistical mechanics of complex networks
- Complex networks: structure and dynamics
- The Structure and Function of Complex Networks
- Spanning trees on the Sierpinski gasket
- The electrical resistance of a graph captures its commute and cover times
- Dimer coverings on the Sierpinski gasket
- Networks
- Optimal throughput-delay scaling in wireless networks. I: The fluid model
- Random walks on dual Sierpinski gaskets
- Incompatibility networks as models of scale-free small-world graphs
- Mean trapping time for an arbitrary node on regular hyperbranched polymers
- Moments of global first passage time and first return time on tree-like fractals
- Exact results for the first-passage properties in a class of fractal networks
This page was built for publication: The mean time to absorption on horizontal partitioned Sierpinski gasket networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653973)
