English
Related papers

Related papers: Universal Ahlfors--David regularity of Steiner tre…

200 papers

In this paper, we study the complexity of two types of digraph packing problems: perfect out-forests problem and Steiner cycle packing problem. For the perfect out-forest problem, we prove that it is NP-hard to decide whether a given strong…

Combinatorics · Mathematics 2022-11-28 Yuefang Sun

Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The…

Data Structures and Algorithms · Computer Science 2019-12-13 Syamantak Das , Lavina Jain , Nikhil Kumar

For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we…

Combinatorics · Mathematics 2017-08-22 Yaping Mao

For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…

Probability · Mathematics 2020-07-09 Christina Goldschmidt , Bénédicte Haas , Delphin Sénizergues

Given a set $P$ of $n$ points in $\mathbb{R}^2$ and an input line $\gamma$ in $\mathbb{R}^2$, we present an algorithm that runs in optimal $\Theta(n\log n)$ time and $\Theta(n)$ space to solve a restricted version of the $1$-Steiner tree…

Computational Geometry · Computer Science 2023-06-16 Prosenjit Bose , Anthony D'Angelo , Stephane Durocher

In this work, we investigate the spectrum of singularities of random stable trees with parameter $\gamma\in(1,2)$. We consider for that purpose the scaling exponents derived from two natural measures on stable trees: the local time $\ell^a$…

Probability · Mathematics 2015-10-27 Paul Balança

We study the Steiner $k$-eccentricity on trees, which generalizes the previous one in the paper [X.~Li, G.~Yu, S.~Klav\v{z}ar, On the average Steiner 3-eccentricity of trees, arXiv:2005.10319, 2020]. To support the algorithm, we achieve…

Combinatorics · Mathematics 2020-08-19 Xingfu Li , Guihai Yu , Sandi Klavžar , Jie Hu , Bo Li

Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative?…

Probability · Mathematics 2016-08-09 Sourav Chatterjee , Sanchayan Sen

We consider low connectivity variants of the Survivable Network with Minimum Number of Steiner Points (SN-MSP) problem: given a finite set $R$ of terminals in a metric space (M,d), a subset $B \subseteq R$ of "unstable" terminals, and…

Data Structures and Algorithms · Computer Science 2013-04-30 Nachshon Cohen , Zeev Nutov

A formula based on a vertex contributions of the Steiner $k$-Wiener index is induced by a newly introduced $k$-Steiner betweenness centrality, which measures the number of $k$-Steiner trees that include a particular vertex as a non-terminal…

Combinatorics · Mathematics 2016-05-11 Matjaž Kovše

We prove an integral inequality and two stability results for the ADM mass on AE K\"ahler manifolds of all complex dimensions. The inequality bounds the ADM mass from below by an integral of the scalar curvature and the Hessian of certain…

Differential Geometry · Mathematics 2024-10-02 Johan Jacoby Klemmensen

A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…

Combinatorics · Mathematics 2024-09-24 Alexey Pokrovskiy

Although the \emph{residual method}, or \emph{constrained regularization}, is frequently used in applications, a detailed study of its properties is still missing. This sharply contrasts the progress of the theory of Tikhonov…

Optimization and Control · Mathematics 2012-12-06 Markus Grasmair , Markus Haltmeier , Otmar Scherzer

Let $f : [0, 1] \to [0, 1]$ be a piecewise expanding unimodal map of class $C^{k+1}$, with $k \geq 1$, and $\mu = \rho dx$ the (unique) SRB measure associated to it. We study the regularity of $\rho$. In particular, points $\mathcal{N}$…

Dynamical Systems · Mathematics 2016-08-24 Fabian Contreras , Dmitry Dolgopyat

In this paper we prove a partial $C^{1,\alpha}$ regularity result in dimension $N=2$ for the optimal $p$-compliance problem, extending for $p\not = 2$ some of the results obtained by A. Chambolle, J. Lamboley, A. Lemenant, E. Stepanov…

Optimization and Control · Mathematics 2025-02-10 Bohdan Bulanyi , Antoine Lemenant

On trees of fixed order, we show a direct relation between Kemeny's constant and Wiener index, and provide a new formula of Kemeny's constant from the relation with a combinatorial interpretation. Moreover, the relation simplifies proofs of…

Combinatorics · Mathematics 2022-09-26 Jihyeug Jang , Sooyeong Kim , Minho Song

Let $(X,d)$ be a compact metric space, $f:X \mapsto X$ be a continuous map satisfying a property we call almost specification (which is slightly weaker than the $g$-almost product property of Pfister and Sullivan), and $\phi$ be a…

Dynamical Systems · Mathematics 2012-05-04 Daniel J. Thompson

This paper proves a conjecture by Solomon about Steiner shallow-light trees (SLT) in Euclidean $d$-space: It is shown that for any finite point set $\mathbb{R}^d$, any root, and any $\epsilon>0$, there is a Euclidean Steiner…

Computational Geometry · Computer Science 2026-05-27 Devin Frost , Kimberly Kokado , Csaba D. Tóth

Let H denote the standard one-point completion of a real Hilbert space. Given any non-trivial proper sub-set U of H one may define the so-called `Apollonian' metric d_U on U. When U \subset V \subset H are nested proper subsets we show that…

Metric Geometry · Mathematics 2011-02-22 Loïc Dubois , Hans Henrik Rugh

The mean density of a random closed set $\Theta$ in $\R^d$ with Hausdorff dimension $n$ is the Radon-Nikodym derivative of the expected measure $\E[\h^n(\Theta\cap\cdot)]$ induced by $\Theta$ with respect to the usual $d$-dimensional…

Probability · Mathematics 2008-03-28 Elena Villa