arXiv research

Study optimal transport on simplex boundary, proving transport map and potential regularity.

We introduce the non-pure versions of simplicial balls and spheres with minimum number of vertices. These are a special type of non-homogeneous balls and spheres (NH-balls and NH-spheres) satisfying a minimality condition on the number of maximal simplices. The main result is that minimal NH-balls and NH-spheres are pr…

We generalize the very well known boundary operator of the ordinary singular homology theory, defined in many books about algebraic topology. We describe a variant of this ordinary simplicial boundary operator where the usual boundary (n-1)-simplices of each n-simplex are replaced by combinations of internal (n-1)- sim…

Estimates dimensions of maximal simplices for rational and irrational trees in Outer space.

Study shows asymptotic behavior of metric near singular points of a Monge-Ampère equation.

We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial operations; (b) in dimension $d \geq 4$, if $Δ$ is a tight connected closed homology $d$…

We construct an example of a Teichmueller geodesic ray whose limit set in Thurston boundary of Teichmueller space is a d-dimensional simplex.

Unfolding paths in Outer space accumulate on a simplex, not converge.

We proof that having boundary of standard 3-dimensional simplex $\partial Δ^3$ as a base of triangulation one can triangulate only trivial and Hopf circle bundles.

Geometry-aware KDE model improves multiclass quantification.

Stochastic gradient Markov chain Monte Carlo (SGMCMC) has become a popular method for scalable Bayesian inference. These methods are based on sampling a discrete-time approximation to a continuous time process, such as the Langevin diffusion. When applied to distributions defined on a constrained space the time-discret…

Sphere-bases for simplicial and cubical complexes are constructed and analyzed.

Paper studies weighted Fermat-Frechet problem for simplex edge lengths.

The paper triangulates Heisenberg groups with horizontal and straight simplexes.

Given a group action on a simplicial complex such that each simplex stabiliser admits a cocompact model of classifying space for proper actions, we give conditions implying the existence of a cocompact model of classifying space for proper actions for the whole group. This is used to generalise previous combination res…

We present a necessary condition for $(\ell-1)$-connected combinatorial $(2\ell +1)$-manifolds to be tight. As a corollary, we show that there is no tight combinatorial three-manifold with Betti number at most two other than the boundary of the four-simplex and the nine-vertex triangulation of the three-dimensional Kle…

While neural networks have achieved high performance in different learning tasks, their accuracy drops significantly in the presence of small adversarial perturbations to inputs. Defenses based on regularization and adversarial training are often followed by new attacks to defeat them. In this paper, we propose attack-…

Study classifies submanifolds in probability simplex.

Minimal triangulations of spheres map almost linearly to boundaries of high-dimensional polytopes.

The Bezier simplex fitting is a novel data modeling technique which exploits geometric structures of data to approximate the Pareto front of multi-objective optimization problems. There are two fitting methods based on different sampling strategies. The inductive skeleton fitting employs a stratified subsampling from e…

PRISM identifies simplex vertices from noisy data.

A new optimization method for probability simplex problems.

We establish the second part of Milnor's conjecture on the volume of simplexes in hyperbolic and spherical spaces. A characterization of the closure of the space of the angle Gram matrices of simplexes is also obtained.

A hyperbolic 3-simplex reflection group is a Coxeter group arising as a lattice in the isometry group of hyperbolic 3-space, with fundamental domain a geodesic simplex (possibly with some ideal vertices). The classification of these groups is known, and there are exactly 9 cocompact examples, and 23 non-cocompact examp…

It is shown that the Hilbert geometry $(D,h_D)$ associated to a bounded convex domain $D\subset \mathbb{E}^n$ is isometric to a normed vector space $(V,||\cdot ||)$ if and only if $D$ is an open $n$-simplex. One further result on the asymptotic geometry of Hilbert's metric is obtained with corollaries for the behavior …

In 1973, J. Cheeger and J. Simons raised the following question that still remains open and is known as the Rational Simplex Problem: Given a geodesic simplex in the spherical 3-space so that all of its interior dihedral angles are rational multiples of $π$, is it true that its volume is a rational multiple of the volu…

Invariants for 3-manifolds with toral boundaries, related by sutured decompositions.

A method for diffusion on probability simplex for generative models.

Simple Deep LDA models achieve accuracy competitive with softmax baselines.

Concrete distribution properties examined on simplex.

We propose that a simple, Lagrangian 2d $\mathcal{N}=(0, 2)$ duality interface between the 3d $\mathcal{N}=2$ XYZ model and 3d $\mathcal{N}=2$ SQED can be associated to the simplest triangulated 4-manifold: the 4-simplex. We then begin to flesh out a dictionary between more general triangulated 4-manifolds with boundar…

A correspondence between three-dimensional flat connections and constant curvature four-dimensional simplices is used to give a novel quantization of geometry via complex SL(2,C) Chern-Simons theory. The resulting quantum geometrical states are hence represented by the 3d blocks of analytically continued Chern-Simons t…

A new method for SSMF improves upon existing algorithms.

A faster Wasserstein k-means algorithm for histogram data reduces computation and maintains clustering quality.

Proposes an accuracy-preserving calibration method for DNNs.

On the probability simplex, we can consider the standard information geometric structure with the e- and m-affine connections mutually dual with respect to the Fisher metric. The geometry naturally defines submanifolds simultaneously autoparallel for the both affine connections, which we call {\em doubly autoparallel s…

A prism is the product space $Δ\times I$ where $Δ$ is a 2-simplex and $I$ is a closed interval. As an analogue of simplicial complexes, we introduce prism complexes and show that every compact $3$-manifold has a prism complex structure. We call a prism complex special if each interior horizontal edge lies in four prism…

Given $L$ a convex body, the $L_p$-Busemann Random Simplex Inequality is closely related to the centroid body $Γ_p L$ for $p=1$ and $2$, and only in these cases it can be proved using the $L_p$-Busemann-Petty centroid inequality. We define a convex body $N_p L$ and prove an isoperimetric inequality for $(N_p L)^\circ$ …

Let $μ$ be a probability measure on $\text{Out}(F_N)$ with finite first logarithmic moment with respect to the word metric, finite entropy, and whose support generates a nonelementary subgroup of $\text{Out}(F_N)$. We show that almost every sample path of the random walk on $(\text{Out}(F_N),μ)$, when realized in Culle…

The paper is devoted to modeling optimal exercise strategies of the behavior of investors and issuers working with convertible bonds. This implies solution of the problems of stock price modeling, payoff computation and min-max optimization. Stock prices (underlying asset) were modeled under the assumption of the geome…

We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmetic operations of our algorithm are polynomial in n. This answers a question of Frieze, Jerrum and Kannan [FJK]. Our resu…

Algorithm learns latent simplex from perturbed points in input-sparsity time.

We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering.

Let n>2 and let M be an orientable complete finite volume hyperbolic n-manifold with (possibly empty) geodesic boundary having Riemannian volume vol(M) and simplicial volume ||M||. A celebrated result by Gromov and Thurston states that if M has empty boundary then the ratio between vol(M) and ||M|| is equal to v_n, whe…

New framework estimates staged tree models using hierarchical clustering on the probability simplex.

CAST predicts distribution-valued time series by stabilizing and transporting simplex-supported successors.

Timelike geometry of spherical simplices is shown to be isometric to vector spaces.

All you need is log