Related papers: Some Exact Results for Spanning Trees on Lattices
For the hard-core lattice gas model defined on independent sets weighted by an activity $\lambda$, we study the critical activity $\lambda_c(\mathbb{Z}^2)$ for the uniqueness/non-uniqueness threshold on the 2-dimensional integer lattice…
We show that numerical linked cluster expansions (NLCEs) based on sufficiently large building blocks allow one to obtain accurate low-temperature results for the thermodynamic properties of spin lattice models with continuous disorder…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
For a real quadratic field $\mathbb{Q}(\sqrt{d})$, we study the norm-form energy $N = S_\zeta^2 - d \cdot S_L^2$, where $S_\zeta$ and $S_L$ are Lorentzian-weighted zero sums with $w(\rho) = 2/(\tfrac{1}{4} + \gamma^2)$. We prove three main…
It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…
A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…
In this study, we consider the nonlinear Sch\"odinger equation (NLS) with the zero-boundary condition on a two- or three-dimensional large finite cubic lattice. We prove that its solution converges to that of the NLS on the entire Euclidean…
Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric…
The stiffness exponents in the glass phase for lattice spin glasses in dimensions $d=3,...,6$ are determined. To this end, we consider bond-diluted lattices near the T=0 glass transition point $p^*$. This transition for discrete bond…
In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…
A classical result by Otter shows that the complete graph has an exponential number of non-isomorphic spanning trees. This was recently extended by Lee to every almost regular graph of sufficiently large degree. In this paper, we consider…
Extended-range percolation on various regular lattices, including all eleven Archimedean lattices in two dimensions, and the simple cubic (SC), body-centered cubic (BCC), and face-centered cubic (FCC) lattices in three dimensions, is…
We consider minimum-cost spanning trees, both in lattice and Euclidean models, in d dimensions. For the cost of the optimum tree in a box of size L, we show that there is a correction of order L^theta, where theta < 0 is a universal…
In this paper we develop a Bethe approximation, based on the cluster variation method, which is apt to study lattice models of branched polymers. We show that the method is extremely accurate in cases where exact results are known as, for…
We present a detailed asymptotic analysis of correlation functions for the two component spanning tree on the two-dimensional lattice when one component contains three paths connecting vicinities of two fixed lattice sites at large distance…
We consider the contact process with infection rate $\lambda$ on $\mathbb{T}_n^d$, the $d$-ary tree of height $n$. We study the extinction time $\tau_{\mathbb{T}_n^d}$, that is, the random time it takes for the infection to disappear when…
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 classify weakly connected spanning closed (WCSC) subgraphs of $\overrightarrow{C_n^2}$, the square of a directed $n$-vertex cycle. Then we show that every spanning tree of $\overrightarrow{C_n^2}$ is contained in a unique nontrivial WCSC…
We provide a sharp estimate for the asymptotic number of lattice zonotopes, inscribed in $[0,n ]^d$ when $n$ tends to infinity. Our estimate refines the logarithmic equivalent established by Barany, Bureaux, and Lund when the sum of the…
Let $\Gamma \leq \mathrm{Aut}(T_{d_1}) \times \mathrm{Aut}(T_{d_2})$ be a group acting freely and transitively on the product of two regular trees of degree $d_1$ and $d_2$. We develop an algorithm which computes the closure of the…