Related papers: Some Exact Results for Spanning Trees on Lattices
In the present communication we consider the one-dimensional (1D) isotopically disordered lattice with the harmonic potential. Our analytical method is adequate for any 1D lattice where potential energy can be presented as the quadratic…
We analyse generating functions for trees and for connected subgraphs on the complete graph, and identify a single scaling profile which applies for both generating functions in a critical window. Our motivation comes from the analysis of…
A tree with $n$ vertices has at most $95^{n/13}$ minimal dominating sets. The growth constant $\lambda = \sqrt[13]{95} \approx 1.4194908$ is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a…
The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…
A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…
Let $A$ be an elliptic operator on a compact manifold with boundary $M$, and let $\wp : \partial\M \to Y$ be a covering map, where $Y$ is a closed manifold. Let $A_C$ be a realization of $A$ subject to a coupling condition $C$ that is…
Using the matrix-forest theorem and the Parisi-Sourlas trick we formulate and solve a one-matrix model with non-polynomial potential which provides perturbation theory for massive spinless fermions on dynamical planar graphs. This is a…
Finding a minimum spanning tree (MST) for $n$ points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $\Omega(n^2)$ time to even approximate. We introduce a…
We present a simple lattice formulation of two-dimensional $\mathcal{N}=(2,2)$ $U(k)$ supersymmetric QCD (SQCD) with $N$ matter multiplets in the fundamental representation. The construction uses compact gauge link variables and exactly…
We study the supercritical contact process on Galton-Watson trees and periodic trees. We prove that if the contact process survives weakly then it dominates a supercritical Crump-Mode-Jagers branching process. Hence the number of infected…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
We prove that every connected triangle-free graph on $n$ vertices contains an induced tree on $\exp(c\sqrt{\log n})$ vertices, where $c$ is a positive constant. The best known upper bound is $(2+o(1))\sqrt n$. This partially answers…
We study finite-temperature properties of strongly correlated fermions in two-dimensional optical lattices by means of numerical linked cluster expansions, a computational technique that allows one to obtain exact results in the…
The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation…
It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4+2 leaves and that this can be improved to (n+4)/3 for cubic graphs without the diamond K_4-e as a subgraph. We generalize the second…
We previously reported on a recursive method to generate the expansion of the lattice Green function of the $d$-dimensional face-centred cubic lattice (fcc). The method was used to generate many coefficients for d=7 and the corresponding…
We show that $(n,d,\lambda)$-graphs with $\lambda=O(d/\log^3 n)$ are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due to Han and Yang of the form…
We study internal diffusion limited aggregation (DLA) on the two dimensional comb lattice. The comb lattice is a spanning tree of the euclidean lattice, and internal DLA is a random growth model, where simple random walks, starting one at a…
We write exact equations for the thermodynamic properties of a linear polymer molecule confined to walk on a lattice of finite size. The dimension of the space in which the lattice resides can be arbitrary. We also calculate polymer…
We simulate the spin-1/2 Ising model and the Blume-Capel model at various values of the parameter D on the simple cubic lattice. We perform a finite size scaling study of lattices of a linear size up to L=360 to obtain accurate estimates…