The Mean Time to Absorption on Horizontal Partitioned Sierpinski Gasket Networks
Zhizhuo Zhang, Bo Wu, Zuguo Yu

TL;DR
This paper investigates how the scale of local self-similar structures in a Horizontal Partitioned Sierpinski Gasket network influences the mean time to absorption of random walks, providing analytical expressions and insights into node absorption efficiency.
Contribution
It introduces a new class of self-similar network models with controllable structure scale and derives analytical formulas for mean absorption time, linking structure size to random walk properties.
Findings
Size of self-similar structures directly affects absorption time.
Analytical expressions for mean time to absorption are derived.
Identified nodes with highest absorption efficiency.
Abstract
The random walk is one of the most basic dynamic properties of complex networks, which has gradually become a research hotspot in recent years due to its many applications in actual networks. An important characteristic of the random walk is the mean time to absorption, which plays an extremely important role in the study of topology, dynamics and practical application of complex networks. Analyzing the mean time to absorption on the regular iterative self-similar network models is an important way to explore the influence of self-similarity on the properties of random walks on the network. The existing literatures have proved that even local self-similar structures can greatly affect the properties of random walks on the global network, but they have failed to prove whether these effects are related to the scale of these self-similar structures. In this article, we construct and study…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Graph theory and applications · Complex Network Analysis Techniques
