Related papers: A Cheeger Inequality for Small Set Expansion

We introduce a notion of intrinsically H\"older graphs in metric spaces. Following a recent paper of Le Donne and the author, we prove some relevant results as the Ascoli-Arzel\`a compactness Theorem, Ahlfors-David regularity and the…

In this paper we study spectra of Laplacians of infinite weighted graphs. Instead of the assumption of local finiteness we impose the condition of summability of the weight function. Such graphs correspond to reversible Markov chains with…

In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are…

We study subgraphs of Paley graphs of prime order $p$ induced on the sets of vertices extending a given independent set of size $a$ to a larger independent set. Using a sufficient condition proved in the author's recent companion work, we…

We introduce \emph{expander evolution algebras} (EEAs), a class of nonassociative algebras defined over an arbitrary field $\K$ in which the underlying undirected loopless graph of the algebra -- in the sense of Kowalski -- is an expander…

In this paper we consider the generalization of the Cheeger problem which comes by considering the ratio between the perimeter and a certain power of the volume. This generalization has been already sometimes treated, but some of the main…

We introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual Cheeger inequalities for eigenvalues of normalized Laplace operators on weighted finite graphs. Our proof proposes a new spectral clustering…

We prove a uniform version of the Tits alternative. As a consequence, we obtain uniform lower bounds for the Cheeger constant of Cayley grahs of finitely generated non virtually solvable linear groups in arbitrary characteristic. Also we…

We introduce a concept of isoperimetric dimension for magnetic graphs, that is, graphs where every edge is assigned a complex number of modulus one. In analogy with the classical case, we show that isoperimetric inequalities imply Sobolev…

For discrete weighted graphs there is sufficient literature about the Cheeger cut and the Cheeger problem, but for metric graphs there are few results about these problems. Our aim is to study the Cheeger cut and the Cheeger problem in…

The Akbari-Cameron-Khosrovshahi (ACK) conjecture, which appears to be unresolved, states that for any simple graph $G$ with at least one edge, there exists a nonzero {$\{0,1\}$}-vector in the row space of its adjacency matrix that is not a…

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

In this paper we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the $n$th mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set…

The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…

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…

Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…

We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…

We show that a simple scoring-based tie-breaking can help improve lower bounds for the expansion (aka isoperimetric number) of random regular graphs with small even degrees. Specifically, for degrees 4, 6 and 8, we show that, with high…

This note is a contribution to large scale geometry. More precisely, we introduce the intrinsically quasi-isometric sections in metric spaces and we investigate their properties: the Ahlfors-David regularity in large scale; following…

We consider non-negative $\sigma$-finite measure spaces coupled with a proper functional $P$ that plays the role of a perimeter. We introduce the Cheeger problem in this framework and extend many classical results on the Cheeger constant…