Related papers: The minimal spanning tree and the upper box dimens…
We introduce a new spanning tree model called the random spanning tree in random environment (RSTRE), which interpolates between the uniform spanning tree and the minimum spanning tree as the inverse temperature (disorder strength) $\beta$…
We show that the asymptotic dimension of box spaces behaves (sub)additively with respect to extensions of groups. As a result, we obtain that for an elementary amenable group, the asymptotic dimension of any of its box spaces is bounded…
We study the sizes of delta-additive sets of unit vectors in a d-dimensional normed space: the sum of any two vectors has norm at most delta. One-additive sets originate in finding upper bounds of vertex degrees of Steiner Minimum Trees in…
This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration…
In this paper, we consider the minimum spanning tree problem (for short, MSTP) on an arbitrary set of $n$ points of $d$-dimensional space in $l_1$-norm. For this problem, for each fixed $d\geq 2$, there is a known algorithm of the…
The threshold-$k$ metric dimension ($\mathrm{Tmd}_k$) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the graph, solely based on its distances from the sensors, when the…
In this paper, we study the problem of finding a minimum weight spanning tree that contains each vertex in a given subset $V_{\rm NT}$ of vertices as an internal vertex. This problem, called Minimum Weight Non-Terminal Spanning Tree,…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
In 1985, Frieze showed that the expected sum of the edge weights of the minimum spanning tree (MST) in the uniformly weighted graph converges to $\zeta(3)$. Recently, Hino and Kanazawa extended this result to a uniformly weighted simplicial…
We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.
For a measure mu supported on a compact connected subset of a Euclidean space which satisfies a uniform d-dimensional decay of the volume of balls we show that the maximal edge in the minimum spanning tree of n indepndent samples from mu…
We establish upper bounds for the spectral gap of the stochastic Ising model at low temperatures in an n-by-n box with boundary conditions which are not purely plus or minus; specifically, we assume the magnitude of the sum of the boundary…
The interrelations between (upper and lower) Minkowski contents and (upper and lower) surface area based contents (S-contents) as well as between their associated dimensions have recently been investigated for general sets in R^d (cf. [3]).…
A broadcast on a nontrivial connected graph G is a function f from V(G) to the set {0,1,...,diam(G)} such that f(v) is at most the eccentricity of v for all vertices v of G. The weight of f is the sum of the function values over V(G). A…
Given two phylogenetic trees with the $\{1, \ldots, n\}$ leaf-set the maximum agreement subtree problem asks what is the maximum size of the subset $A \subseteq \{1, \ldots, n\}$ such that the two trees are equivalent when restricted to…
We show that for every $\alpha > 0$, there exist $n$-point metric spaces (X,d) where every "scale" admits a Euclidean embedding with distortion at most $\alpha$, but the whole space requires distortion at least $\Omega(\sqrt{\alpha \log…
Let X \subset R be a bounded set; we introduce a formula that calculates the upper graph box dimension of X (i.e.the supremum of the upper box dimension of the graph over all uniformly continuous functions defined on X). We demonstrate the…
In the context of radial weights we study the dimension dependence of some weighted inequalities for maximal operators. We study the growth of the $A_1$-constants for radial weights and show the equivalence between the uniform boundedness…
We study the minimum spanning arborescence problem on the complete digraph $\vec{K}_n$ where an edge $e$ has a weight $W_e$ and a cost $C_e$, each of which is an independent uniform random variable $U^\alpha$ where $\alpha\leq 1$ and $U$ is…
Consider an operator that takes the Fourier transform of a discrete measure supported in $\mathcal{X}\subset[-\frac 12,\frac 12)^d$ and restricts it to a compact $\Omega\subset\mathbb{R}^d$. We provide lower bounds for its smallest singular…