中文
相关论文

相关论文: Universal Ahlfors--David regularity of Steiner tre…

200 篇论文

We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…

概率论 · 数学 2014-11-14 Nicolas Curien , Igor Kortchemski

We study the query complexity of the metric Steiner Tree problem, where we are given an $n \times n$ metric on a set $V$ of vertices along with a set $T \subseteq V$ of $k$ terminals, and the goal is to find a tree of minimum cost that…

数据结构与算法 · 计算机科学 2024-11-11 Yu Chen , Sanjeev Khanna , Zihan Tan

We establish a regularity result for optimal sets of the isoperimetric problem with double density under mild ($\alpha$-)H\"older regularity assumptions on the density functions. Our main Theorem improves some previous results and allows to…

偏微分方程分析 · 数学 2023-08-15 Lisa Beck , Eleonora Cinti , Christian Seis

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

组合数学 · 数学 2017-05-08 Péter Csikvári

Let $G$ be a connected graph and $\ell : E(G) \to \mathbb{R}^+$ a length-function on the edges of $G$. The Steiner distance $\mathrm{sd}_G(A)$ of $A \subseteq V(G)$ within $G$ is the minimum length of a connected subgraph of $G$ containing…

组合数学 · 数学 2017-03-30 Daniel Weißauer

The Horton-Strahler (HS) index $r=\max{(i,j)}+\delta_{i,j}$ has been shown to be relevant to a number of physical (such at diffusion limited aggregation) geological (river networks), biological (pulmonary arteries, blood vessels, various…

统计力学 · 物理学 2009-11-07 Z. Toroczkai

We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\em stretch}, where the stretch of $T$ is defined to be the maximum…

数据结构与算法 · 计算机科学 2015-03-03 Costas Busch , Chinmoy Dutta , Jaikumar Radhakrishnan , Rajmohan Rajaraman , Srivathsan Srinivasagopalan

Lightness is a fundamental parameter for Euclidean spanners; it is the ratio of the spanner weight to the weight of the minimum spanning tree of a finite set of points in $\mathbb{R}^d$. In a recent breakthrough, Le and Solomon (2019)…

计算几何 · 计算机科学 2021-03-30 Sujoy Bhore , Csaba D. Tóth

Let $E\subset \mathbb{R}^{n+1}$, $n\ge 2$, be an Ahlfors-David regular set of dimension $n$. We show that the weak-$A_\infty$ property of harmonic measure, for the open set $\Omega:= \mathbb{R}^{n+1}\setminus E$, implies uniform…

经典分析与常微分方程 · 数学 2015-05-26 Steve Hofmann , J. M. Martell

We prove a density version of the Halpern-L\"{a}uchli Theorem. This settles in the affirmative a conjecture of R. Laver. Specifically, let us say that a tree $T$ is homogeneous if $T$ has a unique root and there exists an integer $b\meg 2$…

组合数学 · 数学 2014-10-23 Pandelis Dodos , Vassilis Kanellopoulos , Nikolaos Karagiannis

We prove that the fractal dimension of a metric space equipped with an Ahlfors regular measure can be recovered from the persistent homology of random samples. Our main result is that if $x_1,\ldots, x_n$ are i.i.d. samples from a…

概率论 · 数学 2020-06-26 Benjamin Schweinhart

Consider the multivariate Stein equation $\Delta f - x\cdot \nabla f = h(x) - E h(Z)$, where $Z$ is a standard $d$-dimensional Gaussian random vector, and let $f\_h$ be the solution given by Barbour's generator approach. We prove that, when…

概率论 · 数学 2018-05-07 Thomas Gallouët , Guillaume Mijoule , Yvik Swan

We study the spectral Tur\'an problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^{\delta}$ if $T$ is a tree of…

组合数学 · 数学 2025-05-22 Dheer Noal Desai , Hemanshu Kaul , Bahareh Kudarzi

Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $\mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a…

度量几何 · 数学 2019-06-18 Herbert Edelsbrunner , Nataliya Strelkova

We study notions of hyperuniformity for invariant locally square-integrable point processes in regular trees. We show that such point processes are never geometrically hyperuniform, and if the diffraction measure has support in the…

概率论 · 数学 2024-09-18 Mattias Byléhn

The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V(G)$ which contain $v$. In this paper Steiner $3$-eccentricity is studied on trees. Some general properties of the Steiner…

组合数学 · 数学 2021-07-13 Xingfu Li , Guihai Yu , Sandi Klavžar

We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…

Given a connected graph $G=(V,E)$ and a $k$-set $S\subseteq V(G)$, the $Steiner$ $distance$ $d_{G}(S)$ of $S$ is defined as the size of a minimum tree including $S$ in $G$. The $Steiner$ $k$-$eccentricity$ of a vertex $v$ in $G$ is the…

组合数学 · 数学 2025-12-01 Qingnan Zhang , Yingzhi Tian

A {$t$-stretch tree cover} of a metric space $M = (X,\delta)$, for a parameter $t \ge 1$, is a collection of trees such that every pair of points has a $t$-stretch path in one of the trees. Tree covers provide an important sketching tool…

计算几何 · 计算机科学 2025-08-18 Hung Le , Lazar Milenković , Shay Solomon , Tianyi Zhang

In this article, we study the regularity of minimizing and stationary $p$-harmonic maps between Riemannian manifolds. The aim is obtaining Minkowski-type volume estimates on the singular set $S(f)=\{x \ \ s.t. \ \ f \text{ is not continuous…

偏微分方程分析 · 数学 2016-10-31 Aaron Naber , Daniele Valtorta , Giona Veronelli