Structure of spanning trees on the two-dimensional Sierpinski gasket - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

Structure of spanning trees on the two-dimensional Sierpinski gasket

Abstract

Consider spanning trees on the two-dimensional Sierpinski gasket SG(n) where stage n is a non-negative integer. For any given vertex x of SG(n), we derive rigorously the probability distribution of the degree j ∈{1,2,3,4} at the vertex and its value in the infinite n limit. Adding up such probabilities of all the vertices divided by the number of vertices, we obtain the average probability distribution of the degree j. The corresponding limiting distribution φj gives the average probability that a vertex is connected by 1, 2, 3 or 4 bond(s) among all the spanning tree configurations. They are rational numbers given as φ1=10957/40464, φ2=6626035/13636368, φ3=2943139/13636368, φ4=124895/4545456.
Fichier principal
Vignette du fichier
1286-5658-1-PB.pdf (258 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00993549 , version 1 (20-05-2014)

Identifiers

Cite

Shu-Chiuan Chang, Lung-Chi Chen. Structure of spanning trees on the two-dimensional Sierpinski gasket. Discrete Mathematics and Theoretical Computer Science, 2011, special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity, Vol. 12 no. 3 (3), pp.151-176. ⟨10.46298/dmtcs.476⟩. ⟨hal-00993549⟩

Collections

TDS-MACS
49 View
953 Download

Altmetric

Share

Gmail Facebook X LinkedIn More