相关论文: Spanning forests on the Sierpinski gasket

The Sierpinski gasket is known to support an exotic stochastic process called the asymptotically one-dimensional diffusion. This process displays local anisotropy, as there is a preferred direction of motion which dominates at the…

The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is…

Consider the nearest neighbor graph for the integer lattice Z^d in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphs that are spanning trees. As the piece…

In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…

We give the asymptotic distribution of the length of partial coalescent trees for Beta and related coalescents. This allows us to give the asymptotic distribution of the number of (neutral) mutations in the partial tree. This is a first…

The Sackin index is an important measure for the balance of phylogenetic trees. We investigate two extensions of the Sackin index to the class of galled trees and two of its subclasses (simplex galled trees and normal galled trees) where we…

We determine the walk dimension of the Sierpi\'nski gasket without using diffusion. We construct non-local regular Dirichlet forms on the Sierpi\'nski gasket from regular Dirichlet forms on the Sierpi\'nski graph whose suitable boundary is…

We prove that the growth constants for nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd are asymptotic to 2de as the dimension goes to infinity, and that their critical one-point functions converge to e.…

We define the notion of a spanning tree generating function (STGF) $\sum a_n z^n$, which gives the spanning tree constant when evaluated at $z=1,$ and gives the lattice Green function (LGF) when differentiated. By making use of known…

We confirm, in a more general framework, a part of the conjecture posed by R. Bell, C.-W. Ho, and R. S. Strichartz [Energy measures of harmonic functions on the Sierpi\'nski gasket, Indiana Univ. Math. J. 63 (2014), 831--868] on the…

Kamaldinov, Skorkin, and Zhukovskii proved that the maximum size of an induced subtree in the binomial random graph $G(n,p)$ is concentrated at two consecutive points, whenever $p\in(0,1)$ is a constant. Using improved bounds on the second…

The uniform spanning forest measure ($\mathsf{USF}$) on a locally finite, infinite connected graph $G$ with conductance $c$ is defined as a weak limit of uniform spanning tree measure on finite subgraphs. Depending on the underlying graph…

We study the asymptotic behavior of four statistics associated with subtrees of complete graphs: the uniform probability $p_n$ that a random subtree is a spanning tree of $K_n$, the weighted probability $q_n$ (where the probability a…

Open string amplitudes at tree level have been studied for over fifty years, but there is no known analytic form for general $n$-point amplitudes, and their conventional representation in terms of worldsheet integrals does not make many of…

We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by $d$. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of…

By introducing a new measure for the infinite Galton-Watson process and providing estimates for (discrete) Green's functions on trees, we establish the asymptotic behavior of the capacity of critical branching random walks: in high…

Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their…

We consider sequences of needlet random fields defined as weighted averaged forms of spherical Gaussian eigenfunctions. Our main result is a Central Limit Theorem in the high energy setting, for the boundary lengths of their excursion sets.…

We present the 3- and 4-point tree-level scattering amplitudes involving first-massive states in closed Type IIB superstring theory, computed in the Minkowski vacuum. In particular, the 3-point amplitudes are computed for all possible…

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…