相关论文: Hyperbolic Radial Spanning Tree

We show that a relatively hyperbolic group quasi-isometrically embeds in a product of finitely many trees if the peripheral subgroups do, and we provide an estimate on the minimal number of trees needed. Applying our result to the case of…

Given a set S of n \geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree…

The asymptotically optimal version of Rapidly-exploring Random Tree (RRT*) is often used to find optimal paths in a high-dimensional configuration space. The well-known issue of RRT* is its slow convergence towards the optimal solution. A…

Recent research in Vision-Language Models (VLMs) has significantly advanced our capabilities in cross-modal reasoning. However, existing methods suffer from performance degradation with domain changes or require substantial computational…

Exploiting the theoretical potential of the modified Bonora-Tonin superfield approach (MBTSA) as well as the (anti-)chiral superfield approach (ACSA) to Becchi-Rouet-Stora-Tyutin (BRST) formalism, we derive the complete set of off-shell…

The relative importance of the intrinsic and extrinsic factors determining the variety of geometric shapes exhibited by dendritic trees remains unclear. This question was addressed by developing a model of the growth of dendritic trees…

Let $D_F = \{(z_0, z) \in {\C}^{n} | |z_0|^2 < b, \|z\|^2 < F(|z_0|^2) \}$ be a strongly pseudoconvex Hartogs domain endowed with the \K metric $g_F$ associated to the \K form $\omega_F = -\frac{i}{2} \partial \bar{\partial} \log…

The emergence of Deep Convolutional Neural Networks (DCNNs) has been a pervasive tool for accomplishing widespread applications in computer vision. Despite its potential capability to capture intricate patterns inside the data, the…

Learning generalizable self-supervised graph representations for downstream tasks is challenging. To this end, Contrastive Learning (CL) has emerged as a leading approach. The embeddings of CL are arranged on a hypersphere where similarity…

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…

We consider random hyperbolic graphs in hyperbolic spaces of any dimension $d+1\geq 2$. We present a rescaling of model parameters that casts the random hyperbolic graph model of any dimension to a unified mathematical framework, leaving…

Based on properties of n-subharmonic functions we show that a complete, noncompact, properly embedded hypersurface with nonnegative Ricci curvature in hyperbolic space has an asymptotic boundary at infinity of at most two points. Moreover,…

As a flexible nonparametric learning tool, the random forests algorithm has been widely applied to various real applications with appealing empirical performance, even in the presence of high-dimensional feature space. Unveiling the…

We propose HyperSteiner -- an efficient heuristic algorithm for computing Steiner minimal trees in the hyperbolic space. HyperSteiner extends the Euclidean Smith-Lee-Liebman algorithm, which is grounded in a divide-and-conquer approach…

An ultrametric Cantor set can be seen as the boundary of a rooted weighted tree called the Michon tree. The notion of Assouad dimension is re-interpreted as seen on the Michon tree. The Assouad dimension of an ultrametric Cantor set is…

We study $3$-dimensional partially hyperbolic diffeomorphisms that are homotopic to the identity, focusing on the geometry and dynamics of Burago and Ivanov's center stable and center unstable \emph{branching} foliations. This extends our…

We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…

Natural slender structures, such as plant leaves, petals, and tendrils, often exhibit complex three-dimensional (3D) morphologies-including twisting, helical coiling, and saddle-bending-driven by differential growth. The resulting internal…

In large-scale recommender systems, the user-item networks are generally scale-free or expand exponentially. The latent features (also known as embeddings) used to describe the user and item are determined by how well the embedding space…

We demonstrate that the nilpotent Becchi-Rouet-Stora-Tyutin (BRST) and anti-BRST symmetry invariance of the Lagrangian density of a four (3 + 1)-dimensional (4D) non-Abelian 1-form gauge theory with Dirac fields can be captured within the…