arXiv research

A local cut point is by definition a point that disconnectes its sufficiently small neighborhood. We show that there exists an upper bound for the degree of a local cut point in a metric measure space satisfying the generalized Bishop--Gromov inequality. As a corollary, we obtain an upper bound for the number of ends o…

Nilpotent groups can't be biLipschitz embedded into $L^1$.

This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on minimizing objective functionals defined on proximity graphs of the given sample. Our f…

The paper sets lower bounds on envy-free divisions in cake-cutting problems.

The Wodzicki residue and the cut-off integral extend to classical symbol-valued forms. We show that they obey a Stokes' type property and that the extended Wodzicki residue can be interpreted as a complex residue like the ordinary one. In the case of cut-off integrals, Stokes' property (i.e. vanishing on exact forms) o…

We construct a cut-off version of nonpertubative closed Bosonic string field theory in the light-cone gauge with imaginary string coupling constant. We show that the partition function is a continuous function of the string coupling constant, and conjecture a relation between the formal power series expansion of this p…

RLF uses Riemann-Lebesgue cutting for better regression.

The paper connects cut locus, Thom space, and Morse-Bott functions in Riemannian geometry.

We introduce a novel end-to-end approach for learning to cluster in the absence of labeled examples. Our clustering objective is based on optimizing normalized cuts, a criterion which measures both intra-cluster similarity as well as inter-cluster dissimilarity. We define a differentiable loss function equivalent to th…

The paper studies the cut locus of submanifolds in Riemannian manifolds, providing geometric and topological insights.

We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces. Our invariant measures the difficulty of cutting a nonorientable closed manifold or mod-2 cycle in $\mathbb{R}^n$ into ori…

A Support Vector Method for multivariate performance measures was recently introduced by Joachims (2005). The underlying optimization problem is currently solved using cutting plane methods such as SVM-Perf and BMRM. One can show that these algorithms converge to an eta accurate solution in O(1/Lambda*e) iterations, wh…

We prove some sharp isoperimetric type inequalities for domains with smooth boundary on Riemannian manifolds. For example, using generalized convexity, we show that among all domains with a lower bound $l$ for the cut distance and Ricci curvature lower bound $(n-1)k$, the geodesic ball of radius $l$ in the space form o…

NeuralCut learns to select cutting planes by looking ahead, outperforming traditional methods.

Differentiable cutting-plane layers solve parametric mixed-integer linear optimization problems.

NeVI-Cut uses neural networks to efficiently propagate uncertainty without feedback.

Uniform heat kernel and diffusion bridge asymptotics for sub-Riemannian geometry.

Paper connects probability density cuts to graph theory eigenfunctions.

Study Riemannian metrics on lens spaces, find cut loci and diameters.

Study Riemannian metrics on lens spaces, find cut loci and diameters.

We consider a left invariant Riemannian metric on SO(3) with two equal eigenvalues. We find the cut locus and the equation for the cut time. We find the diameter of such metric and describe the set of all most distant points from the identity. Also we prove that the cut locus and the cut time converge to the cut locus …

New findings on maximizing noise stability in partitions of Gaussian space.

Stability of cut locus under metric perturbations in compact Riemannian manifolds.

New equivalence relation for links using cut-diagrams.

Study shows convergence rates for Cheeger cuts on data clouds.

Unified framework for differentiable graph partitioning with probabilistic cuts.

Stochastic cutting planes improve data-driven optimization speed.

Study of Randers metrics on spheres with simple cut loci.

We define spin-c prequantization of a symplectic manifold to be a spin-c structure and a connection which are compatible with the symplectic form. We describe the cutting of an S^1-equivariant spin-c prequantization. The cutting process involves a choice of a spin-c prequantization for the complex plane. We prove that …

A symplectic cut of a manifold M with a Hamiltonian circle action is a symplectic quotient of M x C. If M is Kaehler then, since C is Kaehler, the cut space is Kaehler as well. The symplectic structure on the cut is well understood. In this paper we describe the complex structure (and hence the metric) on the cut. We t…

This dissertation uses ILP to learn Bayesian network structures efficiently.

It is shown that curvature-dimension bounds CD(N, k) for a metric measure space (X,d,m) in the sense of Sturm imply a weak L^1- Poincare-inequality under some symmetry assumption on the choice of transport rays in the cut locus of (X,d). This condition is satisfied if (X,d) has m-almost surely no branching points.

In this note, we study the cut locus of the free, step two Carnot groups $\mathbb{G}_k$ with $k$ generators, equipped with their left-invariant Carnot-Carathéodory metric. In particular, we disprove the conjectures on the shape of the cut loci proposed in [Myasnichenko - 2002] and [Montanari, Morbidelli - 2016], by exh…

Max flow/min cut theorem extended to currents and topology.

Spectral Clustering as a relaxation of the normalized/ratio cut has become one of the standard graph-based clustering methods. Existing methods for the computation of multiple clusters, corresponding to a balanced $k$-cut of the graph, are either based on greedy techniques or heuristics which have weak connection to th…

Spectral clustering is sensitive to how graphs are constructed from data particularly when proximal and imbalanced clusters are present. We show that Ratio-Cut (RCut) or normalized cut (NCut) objectives are not tailored to imbalanced data since they tend to emphasize cut sizes over cut values. We propose a graph partit…

Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby approached from the perspective of restricted spectral approximation, a modification of the spectral similarity measure used for graph sparsification. This choice is motivated by the observation…

New upper bound for geodesic complexity derived from cut locus decompositions.

Gradually Truncated Log-normal distribution - Size distribution of firms Abstract Many natural and economical phenomena are described through power law or log- normal distributions. In these cases, probability decreases very slowly with step size compared to normal distribution. Thus it is essential to cut-off these di…

New 2-spheres of revolution with simple cut locus structures.

We consider the Lie group PSL(2) (the group of orientation preserving isometries of the hyperbolic plane) and a left-invariant Riemannian metric on this group with two equal eigenvalues that correspond to space-like eigenvectors (with respect to the Killing form). For such metrics we find a parametrization of geodesics…

In this article we extend cutting and blowing up to the nonrational symplectic toric setting. This entails the possibility of cutting and blowing up for symplectic toric manifolds and orbifolds in nonrational directions.

Study exact formula and geodesics for Carnot-Carathéodory distance on 2-step groups.

Spectral clustering methods which are frequently used in clustering and community detection applications are sensitive to the specific graph constructions particularly when imbalanced clusters are present. We show that ratio cut (RCut) or normalized cut (NCut) objectives are not tailored to imbalanced cluster sizes sin…

Functor connects symplectic and contact structures via cutting and blowups.

Improved cutting plane method for convex optimization and games.

In this paper we investigate the small time heat kernel asymptotics on the cut locus on a class of surfaces of revolution, which are the simplest 2-dimensional Riemannian manifolds different from the sphere with non trivial cut-conjugate locus. We determine the degeneracy of the exponential map near a cut-conjugate poi…

Proves a generalized Whitehead cut vertex lemma for tree groups.