Related papers: Minimal distance transformations between links and…
We establish a second-order almost sure limit theorem for the minimal position in a one-dimensional super-critical branching random walk, and also prove a martingale convergence theorem which answers a question of Biggins and Kyprianou [9].…
It is well-understood that different algorithms, training processes, and corpora produce different word embeddings. However, less is known about the relation between different embedding spaces, i.e. how far different sets of embeddings…
We consider sketch vectors of geometric objects $J$ through the \mindist function \[ v_i(J) = \inf_{p \in J} \|p-q_i\| \] for $q_i \in Q$ from a point set $Q$. Collecting the vector of these sketch values induces a simple, effective, and…
Consider a collection of particles interacting through an attractive-repulsive potential given as a difference of power laws and normalized so that its unique minimum occurs at unit separation. For a range of exponents corresponding to mild…
We consider random walk model of a semi-flexible polymer chain on a square and a cubic lattice to enumerate conformations of the polymer chain in two and three dimensions, respectively. The bending energy of the chain is assumed as the key…
In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…
We explore the critical behaviour of two and three dimensional lattice models of polymers in dilute solution where the monomers carry a magnetic moment which interacts ferromagnetically with near-neighbour monomers. Specifically, the model…
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…
We derive an exact formula for the covariance of cartesian distances in two simple polymer models, the freely-jointed chain and a discrete flexible model with nearest-neighbor interaction. We show that even in the interaction-free case…
The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the…
The majority of inverse kinematics (IK) algorithms search for solutions in a configuration space defined by joint angles. However, the kinematics of many robots can also be described in terms of distances between rigidly-attached points,…
We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…
Many real-world machine learning problems involve inherently hierarchical data, yet traditional approaches rely on Euclidean metrics that fail to capture the discrete, branching nature of hierarchical relationships. We present a theoretical…
We study a one dimensional directed polymer model in an inverse-gamma random environment, known as the log-gamma polymer, in three different geometries: point-to-line, point-to-half line and when the polymer is restricted to a half space…
Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…
The distances between flats of a Poisson $k$-flat process in the $d$-dimensional Euclidean space with $k<d/2$ are discussed. Continuing an approach originally due to Rolf Schneider, the number of pairs of flats having distance less than a…
It is now well known that curvature conditions \`a la Bakry-Emery are equivalent to contraction properties of the heat semigroup with respect to the classical quadratic Wasserstein distance. However, this curvature condition may include a…
This report presents a new, algorithmic approach to the distributions of the distance between two points distributed uniformly at random in various polygons, based on the extended Kinematic Measure (KM) from integral geometry. We first…
The paper presents an optimal synthesis of overconstrained linkages, based on the factorization of rational curves (representing one parametric motions) contained in Study's quadric. The group of Euclidean displacements is embedded in a…
Using orthogonal projections, we investigate distance of a given elasticity tensor to classes of elasticity tensors exhibiting particular material symmetries. These projections depend on the orientation of the elasticity tensor, hence the…