Related papers: High-Precision Entropy Values for Spanning Trees i…
Hierarchical tree structures are common in many real-world systems, from tree roots and branches to neuronal dendrites and biologically inspired artificial neural networks, as well as in technological networks for organizing and searching…
We have developed an improved algorithm that allows us to enumerate the number of site animals on the square lattice up to size 46. We also calculate the number of lattice trees up to size 44 and the radius of gyration of both lattice…
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.
In the hyperbolic plane there are infinite regular lattices. From a fix vertex of a lattice tree graphs can be constructed recursively to the next layers with edges of the lattice. In this article we examine the properties of the growing of…
Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in…
Given a set $P$ of $n$ points that are moving in the plane, we consider the problem of computing a spanning tree for these moving points that does not change its combinatorial structure during the point movement. The objective is to…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
One can often make inferences about a growing network from its current state alone. For example, it is generally possible to determine how a network changed over time or pick among plausible mechanisms explaining its growth. In practice,…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
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 introduce the hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas…
We say two spanning trees of a graph are completely independent if their edge sets are disjoint, and for each pair of vertices, the paths between them in each spanning tree do not have any other vertex in common. Pai and Chang constructed…
Three types of explicit estimators are proposed here to estimate the loss rates of the links in a network of the tree topology. All of them are derived by the maximum likelihood principle and proved to be either asymptotic unbiased or…
The structure of an evolving network contains information about its past. Extracting this information efficiently, however, is, in general, a difficult challenge. We formulate a fast and efficient method to estimate the most likely history…
In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including percolation, epidemic…
For a graph $G$, let $\tau(G)$ denote the number of spanning trees. We show that for every fixed $0 < c < 1/4$, the number of distinct values of $\tau(G)$, as $G$ ranges over simple graphs on $n$ vertices, is at least $\exp(c n \log n)$ for…
New entropy measures have been recently introduced for the quantification of the complexity of networks. Most of these entropy measures apply to static networks or to dynamical processes defined on static complex networks. In this paper we…
We study rooted spiral trees in 2,3 and 4 dimensions on a hyper cubical lattice using exact enumeration and Monte-Carlo techniques. On the square lattice, we also obtain exact lower bound of 1.93565 on the growth constant $\lambda$. Series…
We study the minimum spanning tree distribution on the space of spanning trees of the $n$-by-$n$ grid for large $n$. We establish bounds on the decay rates of the probability of the most and the least probable spanning trees as…