Related papers: A Cheeger Cut for Uniform Hypergraphs

We study the Cheeger constant and Cheeger set for domains obtained as strip-like neighbourhoods of curves in the plane. If the reference curve is complete and finite (a "curved annulus"), then the strip itself is a Cheeger set and the…

Hypergraphs naturally arise when studying group relations and have been widely used in the field of machine learning. To the best of our knowledge, the recently proposed edge-dependent vertex weights (EDVW) modeling is one of the most…

In this paper, we consider Cheeger's constant and the first eigenvalue of the nonlinear Laplacian on closed Finsler manifolds. Being based on these, we establish Cheeger's inequality and Buser's inequality for closed Finsler manifolds.

In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

We introduce a family of multi-way Cheeger-type constants $\{h_k^{\sigma}, k=1,2,\ldots, n\}$ on a signed graph $\Gamma=(G,\sigma)$ such that $h_k^{\sigma}=0$ if and only if $\Gamma$ has $k$ balanced connected components. These constants…

We study the volume growth of metric balls as a function of the radius in discrete spaces, and focus on the relationship between volume growth and discrete curvature. We improve volume growth bounds under a lower bound on the so-called…

Let $G$ be a finite group and $S$ be a symmetric generating set of $G$ with $|S| = d$. We show that if the undirected Cayley sum graph $C_{\Sigma}(G,S)$ is an expander graph and is non-bipartite, then the spectrum of its normalised…

Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…

Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=... <= \lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2, \phi(G) =…

We are interested in finding sharp bounds for the Cheeger constant $h$ via different geometrical quantities, namely the area $|\cdot|$, the perimeter $P$, the inradius $r$, the circumradius $R$, the minimal width $\omega$ and the diameter…

A sign is introduced in the usual Laplacian on graphs and the corresponding analogue of the isoperimetric constant for this Laplacian is presented, i.e. a geometric quantity which enables to bound from above and below the first eigenvalue.…

This paper presents a detailed review of both theory and algorithms for the Cheeger cut based on the graph $1$-Laplacian. In virtue of the cell structure of the feasible set, we propose a cell descend (CD) framework for achieving the…

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…

We generalize the Cheeger inequality, a lower bound on the first nontrivial eigenvalue of a Laplacian, to the case of geometric sub-Laplacians on rank-varying Carnot-Carath\'eodory spaces and we describe a concrete method to lower bound the…

We introduce the $st$-cut version the Sparsest-Cut problem, where the goal is to find a cut of minimum sparsity among those separating two distinguished vertices $s,t\in V$. Clearly, this problem is at least as hard as the usual (non-$st$)…

We relate the nontrivial singular values $\sigma_2,\ldots,\sigma_n$ of the normalized adjacency matrix of an Eulerian directed graph to combinatorial measures of graph expansion: \\ 1. We introduce a new directed analogue of conductance…

For a graph $G$ on $n$ vertices with normalized Laplacian eigenvalues $0 = \lambda_1(G) \leq \lambda_2(G) \leq \cdots \leq \lambda_n(G)$ and graph complement $G^c$, we prove that \begin{equation*} \max\{\lambda_2(G),\lambda_2(G^c)\}\geq…

In recent years, hypergraph generalizations of many graph cut problems have been introduced and analyzed as a way to better explore and understand complex systems and datasets characterized by multiway relationships. Recent work has made…

We investigate properties of spectrum of normalized Laplacian $\mathcal L$ for finite graphs over non-Archimedean ordered fields. We prove a Cheeger's inequality for first non-zero eigenvalue. Then we describe properties of the operator…