相关论文: High-Precision Entropy Values for Spanning Trees i…
We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a…
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…
Consider the nearest neighbor graph for the integer lattice Z^d in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphs that are spanning trees. As the piece…
Phylogenetics is now fundamental in life sciences, providing insights into the earliest branches of life and the origins and spread of epidemics. However, finding suitable phylogenies from the vast space of possible trees remains…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of…
The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…
The theory of degree growth and algebraic entropy plays a crucial role in the field of discrete integrable systems. However, a general method for calculating degree growth for lattice equations (partial difference equations) is not yet…
The trace $\tr(q(\ma{L} + q\ma{I})^{-1})$, where $\ma{L}$ is a symmetric diagonally dominant matrix, is the quantity of interest in some machine learning problems. However, its direct computation is impractical if the matrix size is large.…
We show how the sphaleron rate (the Minkowski rate for topological charge diffusion) can be determined by analytical continuation of the Euclidean topological-charge-density two-point function, which we investigate on the lattice, using…
We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
We show that the law of the three-dimensional uniform spanning tree (UST) is tight under rescaling in a space whose elements are measured, rooted real trees, continuously embedded into Euclidean space. We also establish that the relevant…
We derive a new exact evolution equation for the scale dependence of an effective action. The corresponding equation for the effective potential permits a useful truncation. This allows one to deal with the infrared problems of theories…
The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…
Decision trees are widely used for non-linear modeling, as they capture interactions between predictors while producing inherently interpretable models. Despite their popularity, performing inference on the non-linear fit remains largely…
In this paper, we propose a new method for the derivation of a priority vector from an incomplete pairwise comparisons (PC) matrix. We assume that each entry of a PC matrix provided by an expert is also evaluated in terms of the expert's…
The eccentricity of a vertex, $ecc_T(v) = \max_{u\in T} d_T(v,u)$, was one of the first, distance-based, tree invariants studied. The total eccentricity of a tree, $Ecc(T)$, is the sum of eccentricities of its vertices. We determine…
The number of topologically different plane real algebraic curves of a given degree $d$ has the form $\exp(C d^2 + o(d^2))$. We determine the best available upper bound for the constant $C$. This bound follows from Arnold inequalities on…