Related papers: Some Exact Results for Spanning Trees on Lattices
Noncompact SO(1,N) sigma-models are studied in terms of their large N expansion in a lattice formulation in dimensions d \geq 2. Explicit results for the spin and current two-point functions as well as for the Binder cumulant are presented…
We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framework called metric forest completion (MFC), where the learned…
The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices $\beta n$, and in the $n$-th and $(n-1)$-th power graphs of the $\beta n$-cycle are evaluated as a product of…
We study the high-energy limit of tree-level string production amplitudes from decaying D-branes in bosonic string theory, interpreting the vertex operators as external charges interacting with a Coulomb gas corresponding to the rolling…
A new approach to exploring low-temperature excitations in finite-dimensional lattice spin glasses is proposed. By focusing on bond-diluted lattices just above the percolation threshold, large system sizes $L$ can be obtained which lead to…
In a previous paper an asymptotic expansion for lambda_d in powers of 1/d was developed. The results of computer computations for some terms in the expansion, as well as various quantities associated to the expansion, are herein presented.…
We prove that the uniform spanning forests of $\mathbb{Z}^d$ and $\mathbb{Z}^{\ell}$ have qualitatively different connectivity properties whenever $\ell >d \geq 4$. In particular, we consider the graph formed by contracting each tree of the…
A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size $n$ grows…
Continuing the program begun by the authors in a previous paper, we develop an exact low-density expansion for the random minimum spanning tree (MST) on a finite graph, and use it to develop a continuum perturbation expansion for the MST on…
Recently we have shown that a phase transition occurs in the leading and sub-leading approximation of the large N limit in rigid strings coupled to long range Kalb-Ramond interactions. The disordered phase is essentially the…
In 1995, Koml\'os, S\'ark\"ozy and Szemer\'edi showed that every large $n$-vertex graph with minimum degree at least $(1/2 + \gamma)n$ contains all spanning trees of bounded degree. We consider a generalization of this result to loose…
Two-dimensional $CP^{N-1}$ models are investigated by Monte Carlo methods on the lattice, for values of $N$ ranging from 2 to 21. Scaling and rotation invariance are studied by comparing different definitions of correlation length $\xi$.…
Using the special value at $u=1$ of the Artin-Ihara $L$-function, we give a short proof of the count of the number of spanning trees in the $n$-cube.
Recently, Holmes and Perkins identified conditions which ensure that for a class of critical lattice models the scaling limit of the range is the range of super-Brownian motion. One of their conditions is an estimate on a spatial moment of…
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…
We study tree lengths in $\Lambda$-coalescents without a dust component from a sample of $n$ individuals. For the total length of all branches and the total length of all external branches we present laws of large numbers in full…
The classical equations of motion of the perfect lattice action in asymptotically free $d=2$ spin and $d=4$ gauge models possess scale invariant instanton solutions. This property allows the definition of a topological charge on the lattice…
Let $\Lambda$ be a lattice in ${\bf R}^d$ with positive co-volume. Among $\Lambda$-periodic $N$-point configurations, we consider the minimal renormalized Riesz $s$-energy $\mathcal{E}_{s,\Lambda}(N)$. While the dominant term in the…
We show that for every $n$-point metric space $M$ there exists a spanning tree $T$ with unweighted diameter $O(\log n)$ and weight $\omega(T) = O(\log n) \cdot \omega(MST(M))$. Moreover, there is a designated point $rt$ such that for every…
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit…