As a basic dynamic feature on complex networks, the property of random walk has received a lot of attention in recent years. In this paper, we first studied the analytical expression of the mean global first passage time (MGFPT) on the 3-dimensional 3-level Sierpinski gasket network. Based on the self-similar structure of the network, the correlation between the MGFPT and the average trapping time (ATT) is found, and then the analytical expression of the ATT is obtained. Finally, by establishing a joint network model, we further give the standard process of solving the analytical expression of the ATT when there is a set of trap nodes in the network. By illustrating examples and numerical simulations, it can be proved that when the trap node sets are different, the ATT will be quite different, but the the super-linear relationship with the number of iterations will not be changed.
As a classic self-similar network model, Sierpinski gasket network has been used many times to study the characteristics of self-similar structure and its influence on the dynamic properties of the network. However, the network models studied in these problems only contain a single self-similar structure, which is inconsistent with the structural characteristics of the actual network models. In this paper, a type of horizontally segmented 3 dimensional Sierpinski gasket network is constructed, whose main feature is that it contains the locally self-similar structures of the 2 dimensional Sierp…
We derive the macroscopic laws that govern the evolution of the density of particles in the exclusion process on the Sierpinski gasket in the presence of a variable speed boundary. We obtain, at the hydrodynamics level, the heat equation evolving on the Sierpinski gasket with either Dirichlet or Neumann boundary conditions, depending on whether the reservoirs are fast or slow. For a particular strength of the boundary dynamics we obtain linear Robin boundary conditions. As for the fluctuations, we prove that, when starting from the stationary measure, namely the product Bernoulli measure in th…
Internal diffusion-limited aggregation (IDLA) is a stochastic growth model on a graph $G$ which describes the formation of a random set of vertices growing from the origin (some fixed vertex) of $G$. Particles start at the origin and perform simple random walks; each particle moves until it lands on a site which was not previously visited by other particles. This random set of occupied sites in $G$ is called the IDLA cluster. In this paper we consider IDLA on Sierpinski gasket graphs, and show that the IDLA cluster fills balls (in the graph metric) with probability 1.
We establish quantitative spherical shape theorems for rotor-router aggregation and abelian sandpile growth on the graphical Sierpinski gasket ($SG$) when particles are launched from the corner vertex. In particular, the abelian sandpile growth problem is exactly solved via a recursive construction of self-similar sandpile tiles. We show that sandpile growth and patterns exhibit a $(2\cdot 3^n)$-periodicity as a function of the initial mass. Moreover, the cluster explodes---increments by more than 1 in radius---at periodic intervals, a phenomenon not seen on $\mathbb{Z}^d$ or trees. We explici…
