Related papers: Frustration index and Cheeger inequalities for dis…

We extend the definition of boundary expansion to CW complexes and prove a Cheeger-Buser-type relation between the spectral gap of the Laplacian and the boundary expansion of an orientable CW complex.

In this paper, we use machine learning to show that the Cheeger constant of a connected regular graph has a predominant linear dependence on the largest two eigenvalues of the graph spectrum. We also show that a trained deep neural network…

The Hubbard model with geometrical frustration is investigated in a metallic phase close to half-filling. We calculate the single particle spectral function for the triangular lattice within dynamical cluster approximation, which is further…

We introduce the notion of bipartiteness ratio for graphons. We prove the dual Cheeger-Buser inequality for graphons, which relates the gap between $2$ and the top of the spectrum of the Laplacian of a graphon with its bipartiteness ratio.…

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…

In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are…

In this paper, we use various versions of Lov\'asz extension to systematically derive continuous formulations of problems from discrete mathematics. This will take place in the following context: (1) For combinatorial optimization problems…

We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides…

In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…

Geometrically frustrated assemblies where building blocks misfit have been shown to generate intriguing phenomena from self-limited growth, fiber formation, to structural complexity. We introduce a graph theory formulation of geometrically…

Let M be a bounded domain of a Euclidian space with smooth boundary. We relate the Cheeger constant of M and the conductance of a neighborhood graph defined on a random sample from M. By restricting the minimization defining the latter over…

We compute the Cheeger constants of a collection of hyperbolic surfaces corresponding to maximal non-compact arithmetic Fuchsian groups, and to subgroups which are the rotation subgroup of maximal reflection groups. The Cheeger constants…

Spectral clustering is one of the most popular clustering algorithms that has stood the test of time. It is simple to describe, can be implemented using standard linear algebra, and often finds better clusters than traditional clustering…

We study Cheeger and $p$-eigenvalue partition problems depending on a given evaluation function $\Phi$ for $p\in[1,\infty)$. We prove existence and regularity of minima, relations among the problems, convergence, and stability with respect…

We discuss how to formulate a staggered chiral perturbation theory. This amounts to a generalization of the Lee-Sharpe Lagrangian to include more than one flavor (i.e. multiple staggered fields), which turns out to be nontrivial. One loop…

We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph clustering algorithm to find a suitable…

In this paper, we show how sparse or isoperimetric cuts of a probability density function relate to Cheeger cuts of its principal eigenfunction, for appropriate definitions of `sparse cut' and `principal eigenfunction'. We construct these…

We present a thorough study of the theoretical properties and devise efficient algorithms for the \emph{persistent Laplacian}, an extension of the standard combinatorial Laplacian to the setting of pairs (or, in more generality, sequences)…

We develop a novel method based in the sparse random graph to account the interplay between geometric frustration and disorder in cluster magnetism. Our theory allows to introduce the cluster network connectivity as a controllable…

We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…