Related papers: Cheeger $N$-clusters

In this paper, we study the eigenvalue problem \[\left\{\begin{array}{cl}-\hbox{div}\left(a(x)\frac{Du}{|Du|}\right)=\Lambda\, b(x)\frac{u}{|u|} & \text{in }\Omega\\u=0 & \text{on }\partial\Omega,\end{array}\right.\] where $a(x)$ and $b(x)$…

We study existence, uniqueness, and regularity properties of the Dirichlet problem related to fractional Dirichlet energy minimizers in a complete doubling metric measure space $(X,d_X,\mu_X)$ satisfying a $2$-Poincar\'e inequality. Given a…

Improving the explainability of the results from machine learning methods has become an important research goal. Here, we study the problem of making clusters more interpretable by extending a recent approach of [Davidson et al., NeurIPS…

We study the optimal constant in a Sobolev inequality for BV functions with zero mean value and vanishing outside a bounded open set. We are interested in finding the best possible embedding constant in terms of the measure of the domain…

The first nontrivial lower bound of the worst-case approximation ratio for the maxcut problem was achieved via the dual Cheeger problem, whose optimal value is referred to the dual Cheeger constant $h^+$, and later improved through its…

The article gives a ring theoretic perspective on cluster algebras. Gei{\ss}-Leclerc-Schr\"oer prove that all cluster variables in a cluster algebra are irreducible elements. Furthermore, they provide two necessary conditions for a cluster…

We prove that for every planar convex set $\Omega$, the function $t\in (-r(\Omega),+\infty)\longmapsto \sqrt{|\Omega_t|}h(\Omega_t)$ is monotonically decreasing, where $r$, $|\cdot|$ and $h$ stand for the inradius, the measure and the…

We introduce certain relative differential characters which we call Cheeger-Chern-Simons characters. These combine the well-known Cheeger-Simons characters with Chern-Simons forms. In the same way as the Cheeger-Simons characters generalize…

We study the regularity of minimizers of the functional $\mathcal E(u):= [u]_{H^s(\Omega)}^2 +\int_\Omega fu$. This corresponds to understanding solutions for the regional fractional Laplacian in $\Omega\subset\mathbb R^N$. More precisely,…

Given a weighted and complete graph G = (V, E), V denotes the set of n objects to be clustered, and the weight d(u, v) associated with an edge (u, v) belonging to E denotes the dissimilarity between objects u and v. The diameter of a…

This paper introduces the equiwide clustering problem, where valid partitions must satisfy intra-cluster dissimilarity constraints. Unlike most existing clustering algorithms, equiwide clustering relies neither on density nor on a…

As a non-trivial extension of the celebrated Cheeger inequality, the higher-order Cheeger inequalities for graphs due to Lee, Oveis Gharan and Trevisan provide for each $k$ an upper bound for the $k$-way Cheeger constant in forms of…

In this article it is shown that the equilateral triangle maximizes the Cheeger constant and minimizes the torsional rigidity among shapes having a fixed minimal width. The proof techniques use direct comparisons with simpler shapes,…

In this paper we show that any increasing functional of the first k eigenvalues of the Dirichlet Laplacian admits a (quasi-)open minimizer among the subsets of R^N of unit measure. In particular, there exists such a minimizer which is…

We generalize a Cheeger-M\"uller type theorem for flat, unitary bundles on infinite covering spaces over manifolds-with-boundary, proven by Burghelea, Friedlander and Kappeller arXiv:dg-ga/9510010 [math.DG]. Employing recent anomaly results…

Motivated by applications of large-scale graph clustering, we study random-walk-based LOCAL algorithms whose running times depend only on the size of the output cluster, rather than the entire graph. All previously known such algorithms…

Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. However, this process may harm protected (minority) classes if the clustering…

We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…

This survey synthesizes the current state of the art on the regularity theory for solutions to the optimal partition problem. Namely, we consider non-negative, vector-valued Sobolev functions whose components have mutually disjoint support,…

(N, M)-clusters are partitions of $\mathbb{R}^d$ into N+M regions, where N chambers have prescribed finite measure and M chambers have infinite measure. Locally minimizing clusters are the configurations which minimize the perimeter among…