相关论文: Spanning forests on the Sierpinski gasket

We introduce a generalisation of Sch\"{u}tz and Trimper's elephant random walk to finitely generated groups. We focus on the simplest non-abelian setting, i.e. groups whose Cayley graphs are homogeneous trees of degree $d \ge 3$. We show…

Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\lfloor n/3\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound…

We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of…

This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

In this paper, we develop a new method to produce explicit formulas for the number $\tau(n)$ of spanning trees in the undirected circulant graphs $C_{n}(s_1,s_2,\ldots,s_k)$ and $C_{2n}(s_1,s_2,\ldots,s_k,n).$ Also, we prove that in both…

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

The dynamical phenomena of complex networks are very difficult to predict from local information due to the rich microstructures and corresponding complex dynamics. On the other hands, it is a horrible job to compute some stochastic…

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…

The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees $N_{ST}$ and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A…

Random forests remain among the most popular off-the-shelf supervised learning algorithms. Despite their well-documented empirical success, however, until recently, few theoretical results were available to describe their performance and…

We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

This thesis is about local and non-local Dirichlet forms on the Sierpi\'nski gasket and the Sierpi\'nski carpet. We are concerned with the following three problems in analysis on the Sierpi\'nski gasket and the Sierpi\'nski carpet. First, a…

This paper studies the growth of local extrema of Laplacian eigenfunctions on post-critically finite (p.c.f.) fractals. We establish the sharp two-sided estimate $\#\mathrm{Extr}(u_\lambda)\asymp\lambda^{d_S/2}$ for the Sierpinski gasket,…

We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…

In this note we study the geometry of the component of the origin in the Uniform Spanning Forest of $\mathbb{Z}^d$, as well as in the Uniform Spanning Tree of wired subgraphs of $\mathbb{Z}^d$, when $d \ge 5$. In particular, we study…

By using the work of Frantzikinakis and Wierdl, we can see that for all $d\in\mathbb{N}$, $\alpha\in(d,d+1)$, and integers $k\ge d+2$ and $r\ge1$, there exist infinitely many $n\in\mathbb{N}$ such that the sequence…

The Stretched Sierpinski Gasket (or Hanoi attractor) was subject of several prior works. In this work we use this idea of stretching self-similar sets to obtain non-self-similar ones. We are able to do this for a subset of the connected…

We show that the diameter of a uniformly drawn spanning tree of a connected graph on $n$ vertices which satisfies certain high-dimensionality conditions typically grows like $\Theta(\sqrt{n})$. In particular this result applies to…

We construct a family of spectral triples for the Sierpinski Gasket $K$. For suitable values of the parameters, we determine the dimensional spectrum and recover the Hausdorff measure of $K$ in terms of the residue of the volume functional…