相关论文: Hyperbolic Radial Spanning Tree

This paper relates the spectrum of the scalar Laplacian of an asymptotically hyperbolic Einstein metric to the conformal geometry of its ``ideal boundary'' at infinity. It follows from work of R. Mazzeo that the essential spectrum of such a…

Learning the representation of data with hierarchical structures in the hyperbolic space attracts increasing attention in recent years. Due to the constant negative curvature, the hyperbolic space resembles tree metrics and captures the…

First results towards a general method for asymptotic expansions of Feynman amplitudes in the loop-tree duality (LTD) formalism are presented. The asymptotic expansion takes place at integrand-level in the Euclidean space of the loop…

This paper quantifies the speed of convergence and higher- order asymptotics of fast diffusion dynamics on R^n to the Barenblatt (self similar) solution. Degeneracies in the parabolicity of this equation are cured by re-expressing the…

Graph-based methods provide a powerful tool set for many non-parametric frameworks in Machine Learning. In general, the memory and computational complexity of these methods is quadratic in the number of examples in the data which makes them…

The second named author and David Kalaj introduced a pseudometric on any domain in the real Euclidean space $\mathbb R^n$, $n\ge 3$, defined in terms of conformal harmonic discs, by analogy with Kobayashi's pseudometric on complex…

In [9] Kaimanovich introduced the concept of augmented tree on the symbolic space of a self-similar set. It is hyperbolic in the sense of Gromov, and it was shown in [13] that under the open set condition, a self-similar set can be…

Let $T$ be a finitely branching rooted tree such that any node has at least two successors. The path space $[T]$ is an ultrametric space: for distinct paths $f,g$ let $d(f,g)= 1/|T_n|$, where $T_n$ denotes the $n$-th level of the tree, and…

In our work we have reconsidered the old problem of diffusion at the boundary of ultrametric tree from a "number theoretic" point of view. Namely, we use the modular functions (in particular, the Dedekind eta-function) to construct the…

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

We use the language of proper CAT(-1) spaces to study thick, locally compact trees, the real, complex and quaternionic hyperbolic spaces and the hyperbolic plane over the octonions. These are rank 1 Euclidean buildings, respectively rank 1…

Decision trees (DTs) and their random forest (RF) extensions are workhorses of classification and regression in Euclidean spaces. However, algorithms for learning in non-Euclidean spaces are still limited. We extend DT and RF algorithms to…

Parabolic (resp. hyperbolic) self-embeddings of trees are those which do not fix a non-empty finite subtree and preserve precisely one (resp. two) end(s). We prove that a locally finite tree having a parabolic self-embedding is mutually…

Embedding tree-like data, from hierarchies to ontologies and taxonomies, forms a well-studied problem for representing knowledge across many domains. Hyperbolic geometry provides a natural solution for embedding trees, with vastly superior…

By analogy with complex numbers, a system of hyperbolic numbers can be introduced in the same way: z=x+h*y with h*h=1 and x,y real numbers. As complex numbers are linked to the Euclidean geometry, so this system of numbers is linked to the…

A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut…

We consider a class of infinite weighted metric trees obtained as perturbations of self-similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using…

The arrangement of network nodes in hyperbolic spaces has become a widely studied problem, motivated by numerous results suggesting the existence of hidden metric spaces behind the structure of complex networks. Although several methods…

We present warped metrics which solve Einstein equations with arbitrary cosmological constants in both in upper and lower dimensions. When the lower-dimensional metric is the maximally symmetric one compatible with the chosen value of the…

Trajectory similarity is a cornerstone of trajectory data management and analysis. Traditional similarity functions often suffer from high computational complexity and a reliance on specific distance metrics, prompting a shift towards deep…