Related papers: Spanning Trees on Lattices and Integration Identit…

In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…

We prove infinitely many cases of conjectured sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. These bounds come from volumes of associated hyperbolic alternating links, right-angled hyperbolic…

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…

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…

Let $\Gamma$ be an irreducible lattice in $\PSL_2(\RR)^d$ ($d\in\NN$) and $z$ a point in the $d$-fold direct product of the upper half plane. We study the discrete set of componentwise distances ${\bf D}(\Gm,z)\subset \RR^d$ defined in (1).…

Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…

In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…

We examine the exponentially improved asymptotic expansion of the Lerch zeta function $L(\lambda,a,s)=\sum_{n=1}^\infty \exp (2\pi ni\lambda)/(n+a)^s$ for large complex values of $a$, with $\lambda$ and $s$ regarded as parameters. It is…

Tissue growth underpins a wide array of biological and developmental processes, and numerical modeling of growing systems has been shown to be a useful tool for understanding these processes. However, the phenomena that can be captured are…

Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…

Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…

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…

This paper extends the inductive approach to the lace expansion of van der Hofstad and Slade in order to prove Gaussian asymptotic behaviour for models with critical dimension other than 4. The results are applied by Holmes to study…

We show that if a graph admits a packing and a covering both consisting of $\lambda$ many spanning trees, where $\lambda$ is some infinite cardinal, then the graph also admits a decomposition into $\lambda$ many spanning trees. For finite…

We consider a class of unstable surface growth models, z_t = -\partial_x J, developing a mound structure of size lambda and displaying a perpetual coarsening process, i.e. an endless increase in time of lambda. The coarsening exponents n,…

We consider combinatorial aspects of $\lambda$-terms in the model based on de Bruijn indices where each building constructor is of size one. Surprisingly, the counting sequence for $\lambda$-terms corresponds also to two families of binary…

In 1989, Zehavi and Itai conjectured that every $k$-connected graph contains $k$ independent spanning trees rooted at any prescribed vertex $r$. That is, for each vertex $v$, the unique $r$-$v$ paths within these $k$ spanning trees are…

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…

We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…

We prove that, for an undirected graph with $n$ vertices and $m$ edges, each labeled with a linear function of a parameter $\lambda$, the number of different minimum spanning trees obtained as the parameter varies can be $\Omega(m\log n)$.