相关论文: Spanning forests on the Sierpinski gasket

We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…

Let $F(G)$ be the number of forests of a graph $G$. Similarly let $C(G)$ be the number of connected spanning subgraphs of a connected graph $G$. We bound $F(G)$ and $C(G)$ for regular graphs and for graphs with fixed average degree. Among…

We discuss quantitative estimates of the local spectral dimension of the two-dimensional Sierpinski gasket. The present arguments were inspired by a previous study of the distribution of the Kusuoka measure by R. Bell, C.-W. Ho, and R. S.…

The scaling properties of waves of topplings in the sandpile model on the Sierpinski gasket are investigated. The exponent describing the asymptotics of the distribution of last waves in an avalanche is found. Predictions for scaling…

We extend and survey results in the theory of analysis on fractal sets from the standard Laplacian on the Sierpi\'nski gasket to the energy Laplacian, which is defined weakly by using the Kusuoka energy measure. We also extend results from…

We derive the asymptotic distribution of the total length $L_n$ of a $\operatorname {Beta}(2-\alpha,\alpha)$-coalescent tree for $1<\alpha<2$, starting from $n$ individuals. There are two regimes: If $\alpha\le1/2(1+\sqrt{5})$, then $L_n$…

We study the pointwise regularity of energy densities associated with harmonic functions on the $N$-dimensional Sierpinski gasket $(N\ge 2)$ with respect to the Kusuoka measure. For any nonconstant harmonic function, we prove that every…

Asymptotic behaviour of maximum sizes of induced trees and forests has been studied extensively in last decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: 1) We prove $2$-point…

We consider the problem of enumerating spanning trees on lattices. Closed-form expressions are obtained for the spanning tree generating function for a hypercubic lattice of size N_1 x N_2 x...x N_d in d dimensions under free, periodic, and…

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

For the Abelian sandpile model on Sierpinski graphs, we investigate several statistics such as average height, height probabilities and looping constant. In particular, we calculate the expected average height of a recurrent sandpile on the…

Some problems related to the transition density u(t,x) of the diffusion on the Sierpinski gasket are considerd, based on recent rigorous results and detailed numerical calculations. The main contents are an extension of Flory's formula for…

In two dimensions, the $l$-level Sierpinski gasket $\mathrm{SG}(l)$ is obtained by splitting an equilateral triangle into a collection of $l^2$ equilateral triangles of equal size and with the same total area, retaining only the $l(l+1)/2$…

In this work, we study the Anderson model on the Sierpinski gasket graph. We first identify the almost sure spectrum of the Anderson model when the support of the random potential has no gaps. We then prove the existence of the integrated…

One of the ways that analysis on fractals is more complicated than analysis on manifolds is that the asymptotic behavior of the spectral counting function $N(t)$ has a power law modulated by a nonconstant multiplicatively periodic function.…

The generating function for spanning forests on a lattice is related to the q-state Potts model in a certain q -> 0 limit, and extends the analogous notion for spanning trees, or dense self-avoiding branched polymers. Recent works have…

We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…

Empirical observations suggest that in pure even-aged forests, the mean diameter of forest trees (D, diameter at breast height, 1.3 m above ground) tends to remain a constant proportion of stand height (H, average height of the largest…

Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…

We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…