Related papers: Spanning forests on the Sierpinski gasket
We consider the doubly infinite Sierpinski gasket graph $SG_0$, rescale it by factor $2^{-n}$, and on the rescaled graphs $SG_n=2^{-n}SG_0$, for every $n\in \mathbb{N}$, we investigate the limit shape of three aggregation models with…
Let $\mathcal{G}_{n,r,s}$ denote a uniformly random $r$-regular $s$-uniform hypergraph on the vertex set $\{1,2,\ldots, n\}$. We establish a threshold result for the existence of a spanning tree in $\mathcal{G}_{n,r,s}$, restricting to $n$…
In this paper, we compute asymptotics for the determinant of the combinatorial Laplacian on a sequence of $d$-dimensional orthotope square lattices as the number of vertices in each dimension grows at the same rate. It is related to the…
In this paper, we introduce a new method to construct evolving networks based on the construction of the Sierpinski gasket. Using self-similarity and renewal theorem, we obtain the asymptotic formula for average path length of our evolving…
The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the…
We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…
We compute the complexity of two infinite families of finite graphs: the Sierpi\'{n}ski graphs, which are finite approximations of the well-known Sierpi\'nsky gasket, and the Schreier graphs of the Hanoi Towers group $H^{(3)}$ acting on the…
To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…
We obtain the Lifschitz tail asymptotics for the integrated density of states of the subordinate $\alpha-$stable processes on the Sierpi\'nski gasket $\mathcal G,$ evolving among killing Poissonian obstacles. Simultaneously, we derive the…
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…
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…
We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence $\boldsymbol{d}=(d_1,\ldots, d_n)$, provided that the number of edges is at least $n + \textstyle{\frac{1}{2}}…
For a family of domains in the Sierpinski gasket, we study harmonic functions of finite energy, characterizing them in terms of their boundary values, and study their normal derivatives on the boundary. We characterize those domains for…
We prove that the harmonic extension matrices for the level-k Sierpinski Gasket are invertible for every k>2. This has been previously conjectured to be true by Hino in [6] and [7] and tested numerically for k<50. We also give a necessary…
We study the extension problem on the Sierpinski Gasket ($SG$). In the first part we consider minimizing the functional $\mathcal{E}_{\lambda}(f) = \mathcal{E}(f,f) + \lambda \int f^2 d \mu$ with prescribed values at a finite set of points…
We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…
We consider criteria for the differentiability of functions with continuous Laplacian on the Sierpinski Gasket and its higher-dimensional variants $SG_N$, $N>3$, proving results that generalize those of Teplyaev. When $SG_N$ is equipped…
We study invariant percolation processes on the d-regular tree that are obtained as a factor of an iid process. We show that the density of any factor of iid site percolation process with finite clusters is asymptotically at most (log d)/d…
In this paper, we propose an evolving Sierpinski gasket, based on which we establish a model of evolutionary Sierpinski networks (ESNs) that unifies deterministic Sierpinski network [Eur. Phys. J. B {\bf 60}, 259 (2007)] and random…
We prove that loop-erased random walks on finite pre-Sierpinski gaskets can be extended to the infinite pre-Sierpinski gasket by virtue of the `erasing-larger-loops-first' method, and obtain the asymptotic behavior of the walk as the number…