Related papers: A General Euclidean Geometric Representation for t…
Complex network topology might get pretty complicated challenging many network analysis objectives, such as community detection for example. This however makes common emergent network phenomena such as scale-free topology or small-world…
Let $D$ be an $n \times n$ Euclidean distance matrix (EDM) with embedding dimension $r$; and let $d \in R^n$ be a given vector. In this note, we consider the problem of finding a vector $y \in R^n$, that is closest to d in Euclidean norm,…
Graph transformers typically embed every node in a single Euclidean space, blurring heterogeneous topologies. We prepend a lightweight Riemannian mixture-of-experts layer that routes each node to various kinds of manifold, mixture of…
Phylogenetic inference-the derivation of a hypothesis for the common evolutionary history of a group of species- is an active area of research at the intersection of biology, computer science, mathematics, and statistics. One assumes the…
We develop the theory of Wigner representations for general probabilistic theories (GPTs), a large class of operational theories that include both classical and quantum theory. The Wigner representations that we introduce are a natural way…
The skeleton is an essential shape characteristic providing a compact representation of the studied shape. Its computation on the image grid raises many issues. Due to the effects of discretization, the required properties of the skeleton -…
A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…
This paper addresses to the problem of finding the (minimum) Euclidean distance between two linear varieties. This problem is, usually, solved minimising a target function. We propose a novel approach: to use the Moore-Penrose generalised…
We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
Latent Euclidean embedding models a given network by representing each node in a Euclidean space, where the probability of two nodes sharing an edge is a function of the distances between the nodes. This implies that for two nodes to share…
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
The depinning of an elastic line interacting with a quenched disorder is studied for long range interactions, applicable to crack propagation or wetting. An ultrametric distance is introduced instead of the Euclidean distance, allowing for…
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…
We place the theory of metric Diophantine approximation on manifolds into a broader context of studying Diophantine properties of points generic with respect to certain measures on $\Bbb R^n$. The correspondence between multidimensional…
Representation theory, for the classical binary polyhedral groups is encoded by the affine Dynkin diagrams E6^{(1)}, E7^{(1)} and E8^{(1)} (McKay correspondance). The quantum versions of these classical geometries are associated with…
Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…
We analyze both the feasibility and reasonableness of a classical Euclidean Theory of Everything (TOE), which we understand as a TOE based on an Euclidean space and an absolute time over which deterministic models of particles and forces…
We introduce a rotation-invariant representation of planar shapes. In particular, this representation encodes shapes as vectors such that the Euclidean distance between them serves as a valid shape distance. For standardized, star-shaped…
Non-Euclidean method of the generalized geometry construction is considered. According to this approach any generalized geometry is obtained as a result of deformation of the proper Euclidean geometry. The method may be applied for…