A new method for spectral barycentre of graph datasets.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Extends optimal transport to dynamic and martingale settings.
We quantify conditions that ensure that a signed measure on a Riemannian manifold has a well defined centre of mass. We then use this result to quantify the extent of a neighbourhood on which the Riemannian barycentric coordinates of a set of points on an -manifold provide a true coordinate chart, i.e., the ba…
Paper tackles measure estimation in barycentric coding model.
The Riemannian barycentre is one of the most widely used statistical descriptors for probability distributions on Riemannian manifolds. At present, existing algorithms are able to compute the Riemannian barycentre of a probability distribution, only if i.i.d. samples of this distribution are readily available. However,…
This paper investigates the generalization of Principal Component Analysis (PCA) to Riemannian manifolds. We first propose a new and general type of family of subspaces in manifolds that we call barycentric subspaces. They are implicitly defined as the locus of points which are weighted means of reference points.…
Discrete Morse functions induce shellings with critical tiles corresponding to function's critical faces.
Develop a framework for barycentric projections of optimal transport plans on Riemannian manifolds.
We study the barycentric straightening of simplices in irreducible symmetric spaces of non-compact type. We show that, for an n-dimensional symmetric space of rank r>1, the p-Jacobian has uniformly bounded norm, as soon as p is at least n-r+2. As a consequence, for a non-compact, connected, semisimple real Lie group G,…
Associated to any finite flag complex L there is a right-angled Coxeter group W_L and a contractible cubical complex Sigma_L (the Davis complex) on which W_L acts properly and cocompactly, and such that the link of each vertex is L. It follows that if L is a generalized homology sphere, then Sigma_L is a contractible h…
New theorem proves convergence of various discrete conformal structures to conformal maps.
Combines expert models using Kullback-Leibler divergence to create a combined model.
New method solves tree-structured Schrödinger Bridge problems.
Aggregates probability models using Wasserstein space and variational approach.
Minimal displacement set in weakly systolic complexes is systolic and embeds isometrically.
We introduce canonical measures on a locally finite simplicial complex and study their asymptotic behavior under infinitely many barycentric subdivisions. We also compute the face polynomial of the asymptotic link and dual block of a simplex in the barycentric subdivision of , . It is a…
The paper analyzes rates of convergence for optimal transport map estimators using barycentric projections.
A method models nonlinear dynamics from data using barycentric coordinates and memory.
Tree complex linked to polyhedral shapes like associahedra and cyclohedra.
Proposes a fair pricing framework insensitive to protected covariates.
Simpler algorithms for morphing planar and toroidal graphs.
In this paper, we show that one can naturally associate a limiting dynamical system on an -tree to any degenerating sequence of rational maps $f_n: \hat\C \longrightarrow \hat\C$ of fixed degree. The construction of is in steps: first we use barycentric extension to get $\E f_n : \Hy…
Researchers found a way to measure the complexity of Seifert fibered spaces with boundaries.
We establish the equivalence of the Tuynman midpoint area formula for a spherical triangle to the classical area formulas of Euler and of Cagnoli. The derivation also yields a variant of the Cagnoli formula in terms of the medial triangle. We introduce the three barycentric coordinates of a point within the spherical t…
We propose a new embedding method which is particularly well-suited for settings where the sample size greatly exceeds the ambient dimension. Our technique consists of partitioning the space into simplices and then embedding the data points into features corresponding to the simplices' barycentric coordinates. We then …
Two related constructions are studied: (1) The diagonal complex and its barycentric subdivision related to a \textit{punctured} oriented surface equipped with a number of labeled marked points. (2) The symmetric diagonal complex and its barycentric subdivision $\math…
In this paper, we study the dynamics of degenerating sequences of rational maps on Riemann sphere using -trees. Given a sequence of degenerating rational maps, we give two constructions for limiting dynamics on -trees: one geometric and one algebraic. The geometric constructio…
Study sharp inequalities for perimeter functionals in capillarity and convex cones.
We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension , and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds. These geometric simplices are defined using Karcher means. Given a finite set of vertices in a convex set on t…
We present a theory and applications of discrete exterior calculus on simplicial complexes of arbitrary finite dimension. This can be thought of as calculus on a discrete space. Our theory includes not only discrete differential forms but also discrete vector fields and the operators acting on these objects. This allow…
New algorithms solve weak optimal transport problems for nonlinear costs.
The paper examines how edge subdivisions affect the vanishing of -homology in Coxeter groups.
We define barycentric coordinates on a Riemannian manifold using Karcher's center of mass technique applied to point masses for n+1 sufficiently close points, determining an n-dimensional Riemannian simplex defined as a "Karcher simplex." Specifically, a set of weights is mapped to the Riemannian center of mass for the…
New DG method minimizes barycentric alignment and reconstruction loss.
New algorithm learns POMDPs without computational oracles.
Algorithm reduces control regret for unknown systems.
The paper sets lower bounds for adversarial robustness in multiclass classification.
The paper introduces new geometric methods to analyze radar electromagnetic wave statistics.
Let be the group of isotopy classes of orientation preserving homeomorphisms of that preserve a Heegaard splitting of genus two. In this paper, we use a tree in the barycentric subdivision of the disk complex of a handlebody of the splitting to obtain a finite presentation of .
A new associative memory uses Sinkhorn divergence for efficient pattern retrieval.
We consider a finite simplicial complex together with its successive barycentric subdivisions and study the expected topology of a random subcomplex in . We get asymptotic upper and lower bounds for the expected Betti numbers of those subcomplexes, together with the average Morse …
BSA reduces network data by interpreting feature subspaces.
A new algorithm computes Wasserstein barycenters without entropic regularization.
Uniform undistortion in cyclic subgroups of certain groups.
Proposes a new model for time series that considers smooth transitions between states.
Let f:(Y,g)->(X,g_0) be a non zero degree continuous map between compact Kähler manifolds of dimension greater or equal to 2, where g_0 has constant negative holomorphic sectional curvature. Adapting the Besson-Courtois-Gallot barycentre map techniques to the Kähler setting, we prove a gap theorem in terms of the degre…
We show that codimension one dimensional Jacobian of the barycentric straightening map is uniformly bounded for most of the higher rank symmetric spaces. As a consequence, we prove that the locally finite simplicial volume of most -rank locally symmetric spaces is positive, which has been open for many y…
We introduce a notion of Morse shellings (and tilings) on finite simplicial complexes which extends the classical one and its relation to discrete Morse theory.Skeletons and barycentric subdivisions of Morse shellable (or tileable) simplicial complexes are Morse shellable (or tileable). Moreover, every triangulated clo…