Research
On-device research index

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.

168,657 papers · 148 categories

Trend · papers per month

1345 · Jul 202519922001200920172026
48 results for barycentric

A new method for spectral barycentre of graph datasets.

problem Creating a summary graph from a set of graphs with community structure.
method Using multiscale spectral distance based on normalized graph Laplacian eigenvalues.
result The barycentre inherits the topological structure of the graphs in the sample dataset.

Extends optimal transport to dynamic and martingale settings.

problem Dynamic and martingale relaxation of optimal transport problems.
method Extends Benamou-Brenier formula to weak optimal transport and introduces barycentric optimal transport.
result Relates barycentric optimal transport to martingale Benamou-Brenier formula.

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 n+1n+1 points on an nn-manifold provide a true coordinate chart, i.e., the ba…

2016-06-05abs ↗pdf ↗

Paper tackles measure estimation in barycentric coding model.

problem Estimating an unknown measure in the barycentric coding model.
method Geometric, statistical, and computational insights; quadratic optimization problem; empirical i.i.d. samples algorithm.
result Proves precise rates of convergence for algorithm, ensuring statistical consistency.

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,…

2019-08-23abs ↗pdf ↗

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 k+1k+1 reference points.…

2016-07-11abs ↗pdf ↗

Discrete Morse functions induce shellings with critical tiles corresponding to function's critical faces.

problem Mapping discrete Morse functions to shellings for topological analysis.
method Inducing Morse shellings on the second barycentric subdivision of a simplicial complex.
result Critical tiles of induced shellings correspond to critical faces of the discrete Morse function.

Develop a framework for barycentric projections of optimal transport plans on Riemannian manifolds.

problem Optimal transport couplings are probabilistic objects, while many learning pipelines require deterministic maps.
method Develop a framework for barycentric projections of transport couplings on Riemannian manifolds.
result The intrinsic projection maps each source point to the conditional Fréchet mean of its destination law and is shown to be the best deterministic representative under squared geodesic loss.

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,…

2015-03-22abs ↗pdf ↗

New theorem proves convergence of various discrete conformal structures to conformal maps.

problem Proving convergence of discrete conformal structures to conformal maps.
method General theorem using piecewise linear discrete conformal mappings and Riemannian barycentric coordinates.
result Discrete conformal mappings converge to conformal maps under certain conditions.

New method solves tree-structured Schrödinger Bridge problems.

problem Computing Schrödinger Bridge between tree-structured distributions.
method Iterative Markovian Fitting (IMF) procedure for tree-structured costs.
result Extends IMF to tree-structured Schrödinger Bridge problems.

Aggregates probability models using Wasserstein space and variational approach.

problem Model aggregation in the Wasserstein space of distributions.
method Data-driven calibration framework based on ΓΓ-convergence.
result Empirical minimizers converge to the minimizers of the actual problem.

We introduce canonical measures on a locally finite simplicial complex KK 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 dthd^{th} barycentric subdivision Sdd(K)Sd^d(K) of KK, d0d\gg0. It is a…

2017-06-07abs ↗pdf ↗

The paper analyzes rates of convergence for optimal transport map estimators using barycentric projections.

problem Estimating optimal transport maps from data sampled according to two distributions.
method Comprehensive analysis of rates of convergence for plug-in estimators defined via barycentric projections.
result New stability estimate for barycentric projections under minimal smoothness assumptions.

Tree complex linked to polyhedral shapes like associahedra and cyclohedra.

problem Understanding the structure of mapping class groups and complex dynamics.
method Characterizing associahedra and cyclohedra using planar tree embeddings and barycentric subdivision.
result Tree complex is a barycentric subdivision of a polyhedral cell complex made of associahedra and cyclohedra.

In this paper, we show that one can naturally associate a limiting dynamical system F:TTF: T\longrightarrow T on an R\R-tree to any degenerating sequence of rational maps $f_n: \hat\C \longrightarrow \hat\C$ of fixed degree. The construction of FF is in 22 steps: first we use barycentric extension to get $\E f_n : \Hy…

2019-05-02abs ↗pdf ↗

Researchers found a way to measure the complexity of Seifert fibered spaces with boundaries.

problem Measuring the complexity of Seifert fibered spaces with boundaries.
method Relating triangulation complexity to Seifert data and using barycentric subdivision.
result Determined triangulation complexity in terms of Seifert data and showed singular fibres can be made simplicial.

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…

2014-04-26abs ↗pdf ↗

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 …

2020-02-05abs ↗pdf ↗

Study sharp inequalities for perimeter functionals in capillarity and convex cones.

problem Quantitative isoperimetric inequalities for perimeter functionals in capillarity and convex cones.
method Derivation of Fuglede-type estimates and application of selection principle.
result Sharp quantitative isoperimetric inequalities in strong and barycentric forms.

We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension nn, 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…

2014-06-14abs ↗pdf ↗

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…

2005-08-18abs ↗pdf ↗

The paper examines how edge subdivisions affect the vanishing of L2L^2-homology in Coxeter groups.

problem The vanishing of L2L^2-homology in Coxeter groups under edge subdivisions.
method Investigates conditions for the vanishing of L2L^2-homology to be preserved under edge subdivisions of flag triangulations.
result Conditions are given to preserve the vanishing of L2L^2-homology under edge subdivisions, and counterexamples are constructed for a torsion growth analogue of Singer's conjecture.

The paper sets lower bounds for adversarial robustness in multiclass classification.

problem Adversarial robustness in multiclass classification with arbitrary loss functions.
method Dual and barycentric reformulations for robust risk minimization.
result Sharp lower bounds for adversarial risks are computed efficiently.

The paper introduces new geometric methods to analyze radar electromagnetic wave statistics.

problem Analyzing spatio-temporal and polarimetric fluctuations of radar electromagnetic waves.
method Using statistical mechanics and Information Geometry, the paper defines a Fréchet barycentre and maximum entropy density for radar measurements.
result New tools for describing radar electromagnetic wave fluctuations, including a distance on covariance matrices.

A new associative memory uses Sinkhorn divergence for efficient pattern retrieval.

problem Efficiently retrieving patterns from large datasets of weighted point clouds.
method Derived retrieval dynamics as a SHK gradient flow, discretized for a deterministic algorithm.
result Proved basin invariance, geometric convergence, and robust recovery from perturbations.

We consider a finite simplicial complex KK together with its successive barycentric subdivisions Sdd(K),d0,Sd^d(K), d\geq0, and study the expected topology of a random subcomplex in Sdd(K),d0Sd^d(K), d\gg0. We get asymptotic upper and lower bounds for the expected Betti numbers of those subcomplexes, together with the average Morse …

2017-06-07abs ↗pdf ↗

Proposes a new model for time series that considers smooth transitions between states.

problem Models assume instantaneous transitions between discrete states, ignoring gradual changes.
method Dynamical Wasserstein Barycentric (DWB) model that estimates system state and pure state distributions over time.
result Accurately learns pure state distributions and improves state estimation for transition periods.

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 Q\mathbb Q-rank 11 locally symmetric spaces is positive, which has been open for many y…

2015-03-09abs ↗pdf ↗

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…

2019-10-29abs ↗pdf ↗