Related papers: High-Precision Entropy Values for Spanning Trees i…
In this paper, we develop a new method to produce explicit formulas for the number $\tau(n)$ of spanning trees in the undirected circulant graphs $C_{n}(s_1,s_2,\ldots,s_k)$ and $C_{2n}(s_1,s_2,\ldots,s_k,n).$ Also, we prove that in both…
Given points in Euclidean space of arbitrary dimension, we prove that there exists a spanning tree having no vertices of degree greater than 3 with weight at most 1.559 times the weight of the minimum spanning tree. We also prove that there…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
It is well-known that the number of spanning trees, denoted by $\tau(G)$, in a connected multi-graph $G$ can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction theorem. In this short note, we find an alternate method…
The double integral representing the entropy S_{tri} of spanning trees on a large triangular lattice is evaluated using two different methods, one algebraic and one graphical. Both methods lead to the same result S_{tri} = [1/(2 Pi)]^2…
The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical enumeration of…
Large language models achieve strong reasoning performance, yet existing decoding strategies either explore blindly (random sampling) or redundantly (independent multi-sampling). We propose Entropy-Tree, a tree-based decoding method that…
A large number of explicit estimators are proposed in this paper for loss rate estimation in a network of the tree topology. All of the estimators are proved to be unbiased and consistent instead of asymptotic unbiased as that obtained in…
The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…
We prove that, among rectangular grid graphs with a fixed number of vertices, the number of spanning trees increases when the side lengths are made more balanced. In particular, among all rectangular grid graphs with $n^2$ vertices, the…
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…
Extending some properties from the Euclidean plane to any normed plane, we show the validity of the Monma-Paterson-Suri-Yao algorithm for finding the maximum-weighted spanning tree of a set of $n$ points, where the weight of an edge is the…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
Spanning trees are relevant to various aspects of networks. Generally, the number of spanning trees in a network can be obtained by computing a related determinant of the Laplacian matrix of the network. However, for a large generic…
We develop a new method to determine thermal activation rates, such as for bubble nucleation, topology change, \textsl{etc.}, using 4-dimensional Euclidean methods. This allows nonperturbative study on the lattice. We then investigate the…
Cayley's formula states that there are $n^{n-2}$ spanning trees in the complete graph on $n$ vertices; it has been proved in more than a dozen different ways over its 150 year history. The complete graphs are a special case of threshold…
The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…
We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some…
The dynamical phenomena of complex networks are very difficult to predict from local information due to the rich microstructures and corresponding complex dynamics. On the other hands, it is a horrible job to compute some stochastic…
Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph and either a path or a cycle, of which grid graphs are a…